TSTP Solution File: SWC145+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC145+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_uns --cores 0 -t %d %s
% Computer : n003.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:39:06 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 110 ( 27 equ)
% Maximal formula atoms : 18 ( 7 avg)
% Number of connectives : 127 ( 31 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 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(f164,plain,
$false,
inference(subsumption_resolution,[],[f148,f156]) ).
fof(f156,plain,
~ neq(sK6,nil),
inference(definition_unfolding,[],[f153,f152]) ).
fof(f152,plain,
sK8 = sK6,
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( ~ neq(sK8,nil)
& sK8 = sK6
& sK7 = sK5
& ~ singletonP(sK6)
& ssList(sK8)
& neq(sK6,nil)
& ssList(sK7)
& ssList(sK6)
& ssList(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f106,f124,f123,f122,f121]) ).
fof(f121,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X1 = X3
& X0 = X2
& ~ singletonP(X1)
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X1 = X3
& sK5 = X2
& ~ singletonP(X1)
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X1 = X3
& sK5 = X2
& ~ singletonP(X1)
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& sK6 = X3
& sK5 = X2
& ~ singletonP(sK6)
& ssList(X3)
& neq(sK6,nil) )
& ssList(X2) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& sK6 = X3
& sK5 = X2
& ~ singletonP(sK6)
& ssList(X3)
& neq(sK6,nil) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(X3,nil)
& sK6 = X3
& sK7 = sK5
& ~ singletonP(sK6)
& ssList(X3)
& neq(sK6,nil) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X3] :
( ~ neq(X3,nil)
& sK6 = X3
& sK7 = sK5
& ~ singletonP(sK6)
& ssList(X3)
& neq(sK6,nil) )
=> ( ~ neq(sK8,nil)
& sK8 = sK6
& sK7 = sK5
& ~ singletonP(sK6)
& ssList(sK8)
& neq(sK6,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X1 = X3
& X0 = X2
& ~ singletonP(X1)
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ~ neq(X3,nil)
& ~ singletonP(X1)
& 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)
=> ( X0 != X2
| ~ neq(X1,nil)
| neq(X3,nil)
| singletonP(X1)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ~ neq(X1,nil)
| neq(X3,nil)
| singletonP(X1)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f153,plain,
~ neq(sK8,nil),
inference(cnf_transformation,[],[f125]) ).
fof(f148,plain,
neq(sK6,nil),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC145+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:27:07 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.50 % (26953)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (26958)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (26944)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51 % (26944)Instruction limit reached!
% 0.20/0.51 % (26944)------------------------------
% 0.20/0.51 % (26944)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (26944)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (26944)Termination reason: Unknown
% 0.20/0.51 % (26944)Termination phase: Preprocessing 3
% 0.20/0.51
% 0.20/0.51 % (26944)Memory used [KB]: 1663
% 0.20/0.51 % (26944)Time elapsed: 0.003 s
% 0.20/0.51 % (26944)Instructions burned: 4 (million)
% 0.20/0.51 % (26944)------------------------------
% 0.20/0.51 % (26944)------------------------------
% 0.20/0.51 % (26966)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (26953)First to succeed.
% 0.20/0.51 % (26949)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (26945)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (26953)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (26953)------------------------------
% 0.20/0.52 % (26953)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26953)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (26953)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (26953)Memory used [KB]: 6012
% 0.20/0.52 % (26953)Time elapsed: 0.006 s
% 0.20/0.52 % (26953)Instructions burned: 3 (million)
% 0.20/0.52 % (26953)------------------------------
% 0.20/0.52 % (26953)------------------------------
% 0.20/0.52 % (26941)Success in time 0.163 s
%------------------------------------------------------------------------------