## TSTP Solution File: LCL666+1.001 by SnakeForV-SAT---1.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 17:49:23 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   75 (  39   ~;  19   |;  16   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   17 (  11   !;   6   ?)

%------------------------------------------------------------------------------
fof(f15,plain,
\$false,
inference(subsumption_resolution,[],[f14,f9]) ).

fof(f9,plain,
p201(sK0),
inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
( p101(sK0)
& ! [X1] :
( ~ r1(sK0,X1)
| ~ p101(X1)
| ~ p201(X1) )
& p201(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f7,plain,
( ? [X0] :
( p101(X0)
& ! [X1] :
( ~ r1(X0,X1)
| ~ p101(X1)
| ~ p201(X1) )
& p201(X0) )
=> ( p101(sK0)
& ! [X1] :
( ~ r1(sK0,X1)
| ~ p101(X1)
| ~ p201(X1) )
& p201(sK0) ) ),
introduced(choice_axiom,[]) ).

fof(f6,plain,
? [X0] :
( p101(X0)
& ! [X1] :
( ~ r1(X0,X1)
| ~ p101(X1)
| ~ p201(X1) )
& p201(X0) ),
inference(flattening,[],[f5]) ).

fof(f5,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ r1(X0,X1)
| ~ p201(X1)
| ~ p101(X1) ) ),
inference(ennf_transformation,[],[f4]) ).

fof(f4,plain,
? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( p201(X1)
& p101(X1) ) ) ),
inference(flattening,[],[f3]) ).

fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( p201(X1)
& p101(X1) ) ) ),
inference(negated_conjecture,[],[f2]) ).

fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( p201(X1)
& p101(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(f14,plain,
~ p201(sK0),
inference(subsumption_resolution,[],[f13,f11]) ).

fof(f11,plain,
p101(sK0),
inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
( ~ p101(sK0)
| ~ p201(sK0) ),
inference(resolution,[],[f10,f12]) ).

fof(f12,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

fof(f10,plain,
! [X1] :
( ~ r1(sK0,X1)
| ~ p101(X1)
| ~ p201(X1) ),
inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 02:29:48 EDT 2022
% 0.13/0.34  % CPUTime    :
% 0.20/0.49  % (30349)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.50  % (30360)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.50  % (30343)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50  % (30346)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.50  % (30343)First to succeed.
% 0.20/0.51  % (30347)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.51  % (30350)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.51  % (30343)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (30343)------------------------------
% 0.20/0.51  % (30343)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (30343)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (30343)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51  % (30343)Memory used [KB]: 5373
% 0.20/0.51  % (30343)Time elapsed: 0.112 s
% 0.20/0.51  % (30343)------------------------------
% 0.20/0.51  % (30343)------------------------------
% 0.20/0.51  % (30338)Success in time 0.155 s
%------------------------------------------------------------------------------
```