TSTP Solution File: SWC036+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC036+1 : TPTP v8.1.0. Released v2.4.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 : n016.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 18:41:19 EDT 2022
% Result : Theorem 0.15s 0.48s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 130 ( 89 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 146 ( 35 ~; 21 |; 78 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f689,plain,
$false,
inference(subsumption_resolution,[],[f649,f602]) ).
fof(f602,plain,
sK38 != sK39,
inference(definition_unfolding,[],[f489,f556,f487]) ).
fof(f487,plain,
sK36 = sK38,
inference(cnf_transformation,[],[f309]) ).
fof(f309,plain,
( ssList(sK38)
& nil = sK37
& ssList(sK39)
& nil != sK36
& sK37 = sK39
& sK36 = sK38
& ( nil = sK38
| nil != sK39 )
& ssList(sK37)
& ssList(sK36) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK36,sK37,sK38,sK39])],[f169,f308,f307,f306,f305]) ).
fof(f305,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = X1
& ssList(X3)
& nil != X0
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = X1
& ssList(X3)
& nil != sK36
& X1 = X3
& sK36 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f306,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = X1
& ssList(X3)
& nil != sK36
& X1 = X3
& sK36 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = sK37
& ssList(X3)
& nil != sK36
& sK37 = X3
& sK36 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f307,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = sK37
& ssList(X3)
& nil != sK36
& sK37 = X3
& sK36 = X2
& ( nil = X2
| nil != X3 ) ) )
=> ( ssList(sK38)
& ? [X3] :
( nil = sK37
& ssList(X3)
& nil != sK36
& sK37 = X3
& sK36 = sK38
& ( nil = sK38
| nil != X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f308,plain,
( ? [X3] :
( nil = sK37
& ssList(X3)
& nil != sK36
& sK37 = X3
& sK36 = sK38
& ( nil = sK38
| nil != X3 ) )
=> ( nil = sK37
& ssList(sK39)
& nil != sK36
& sK37 = sK39
& sK36 = sK38
& ( nil = sK38
| nil != sK39 ) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil = X1
& ssList(X3)
& nil != X0
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f168]) ).
fof(f168,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& ( nil = X2
| nil != X3 )
& X0 = X2
& nil != X0
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| ( nil != X2
& nil = X3 )
| X0 != X2
| nil = X0
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| ( nil != X2
& nil = X3 )
| X0 != X2
| nil = X0
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f556,plain,
nil = sK39,
inference(definition_unfolding,[],[f491,f488]) ).
fof(f488,plain,
sK37 = sK39,
inference(cnf_transformation,[],[f309]) ).
fof(f491,plain,
nil = sK37,
inference(cnf_transformation,[],[f309]) ).
fof(f489,plain,
nil != sK36,
inference(cnf_transformation,[],[f309]) ).
fof(f649,plain,
sK38 = sK39,
inference(trivial_inequality_removal,[],[f603]) ).
fof(f603,plain,
( sK39 != sK39
| sK38 = sK39 ),
inference(definition_unfolding,[],[f486,f556,f556]) ).
fof(f486,plain,
( nil = sK38
| nil != sK39 ),
inference(cnf_transformation,[],[f309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC036+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 18:24:01 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.45 % (25892)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.15/0.46 % (25893)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.46 % (25901)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.15/0.46 % (25902)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.15/0.47 % (25902)First to succeed.
% 0.15/0.48 % (25893)Instruction limit reached!
% 0.15/0.48 % (25893)------------------------------
% 0.15/0.48 % (25893)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48 % (25908)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.15/0.48 % (25910)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.15/0.48 % (25894)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.48 % (25894)Instruction limit reached!
% 0.15/0.48 % (25894)------------------------------
% 0.15/0.48 % (25894)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48 % (25902)Refutation found. Thanks to Tanya!
% 0.15/0.48 % SZS status Theorem for theBenchmark
% 0.15/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48 % (25902)------------------------------
% 0.15/0.48 % (25902)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48 % (25902)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48 % (25902)Termination reason: Refutation
% 0.15/0.48
% 0.15/0.48 % (25902)Memory used [KB]: 5884
% 0.15/0.48 % (25902)Time elapsed: 0.103 s
% 0.15/0.48 % (25902)Instructions burned: 12 (million)
% 0.15/0.48 % (25902)------------------------------
% 0.15/0.48 % (25902)------------------------------
% 0.15/0.48 % (25885)Success in time 0.165 s
%------------------------------------------------------------------------------