TSTP Solution File: SWC035+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC035+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 : n025.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.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 114 ( 73 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 118 ( 22 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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(f647,plain,
$false,
inference(trivial_inequality_removal,[],[f560]) ).
fof(f560,plain,
sK9 != sK9,
inference(definition_unfolding,[],[f354,f556,f557]) ).
fof(f557,plain,
sK6 = sK9,
inference(definition_unfolding,[],[f350,f353]) ).
fof(f353,plain,
sK8 = sK9,
inference(cnf_transformation,[],[f236]) ).
fof(f236,plain,
( ssList(sK6)
& ssList(sK7)
& nil != sK6
& sK8 = sK9
& sK7 = sK9
& nil = sK7
& sK6 = sK8
& ssList(sK9)
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f152,f235,f234,f233,f232]) ).
fof(f232,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != X0
& X2 = X3
& X1 = X3
& nil = X1
& X0 = X2
& ssList(X3) )
& ssList(X2) ) ) )
=> ( ssList(sK6)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != sK6
& X2 = X3
& X1 = X3
& nil = X1
& sK6 = X2
& ssList(X3) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f233,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != sK6
& X2 = X3
& X1 = X3
& nil = X1
& sK6 = X2
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK7)
& ? [X2] :
( ? [X3] :
( nil != sK6
& X2 = X3
& sK7 = X3
& nil = sK7
& sK6 = X2
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f234,plain,
( ? [X2] :
( ? [X3] :
( nil != sK6
& X2 = X3
& sK7 = X3
& nil = sK7
& sK6 = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( nil != sK6
& sK8 = X3
& sK7 = X3
& nil = sK7
& sK6 = sK8
& ssList(X3) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f235,plain,
( ? [X3] :
( nil != sK6
& sK8 = X3
& sK7 = X3
& nil = sK7
& sK6 = sK8
& ssList(X3) )
=> ( nil != sK6
& sK8 = sK9
& sK7 = sK9
& nil = sK7
& sK6 = sK8
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( nil != X0
& X2 = X3
& X1 = X3
& nil = X1
& X0 = X2
& ssList(X3) )
& ssList(X2) ) ) ),
inference(flattening,[],[f151]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& nil != X0
& X0 = X2
& nil = X1
& X2 = 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)
=> ( X1 != X3
| nil = X0
| X0 != X2
| nil != X1
| X2 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| nil = X0
| X0 != X2
| nil != X1
| X2 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f350,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f236]) ).
fof(f556,plain,
nil = sK9,
inference(definition_unfolding,[],[f351,f352]) ).
fof(f352,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f236]) ).
fof(f351,plain,
nil = sK7,
inference(cnf_transformation,[],[f236]) ).
fof(f354,plain,
nil != sK6,
inference(cnf_transformation,[],[f236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC035+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % 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.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:10:00 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.47 % (15595)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.48 % (15594)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.20/0.48 % (15587)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.20/0.48 % (15573)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.49 % (15581)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 % (15584)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.49 % (15595)First to succeed.
% 0.20/0.49 % (15579)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49 % (15574)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.49 % (15573)Also succeeded, but the first one will report.
% 0.20/0.49 % (15595)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (15595)------------------------------
% 0.20/0.49 % (15595)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (15595)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (15595)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (15595)Memory used [KB]: 5756
% 0.20/0.49 % (15595)Time elapsed: 0.011 s
% 0.20/0.49 % (15595)Instructions burned: 8 (million)
% 0.20/0.49 % (15595)------------------------------
% 0.20/0.49 % (15595)------------------------------
% 0.20/0.49 % (15567)Success in time 0.154 s
%------------------------------------------------------------------------------