TSTP Solution File: SWC138+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC138+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 : n023.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:04 EDT 2022
% Result : Theorem 0.20s 0.54s
% 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 : 97 ( 27 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 102 ( 19 ~; 6 |; 65 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 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(f180,plain,
$false,
inference(subsumption_resolution,[],[f170,f164]) ).
fof(f164,plain,
~ neq(sK7,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK6)
& sK4 = sK6
& neq(sK5,nil)
& sK5 = sK7
& ~ neq(sK7,nil)
& ssList(sK7)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f114,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& neq(X1,nil)
& X1 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK4 = X2
& neq(X1,nil)
& X1 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK4 = X2
& neq(X1,nil)
& X1 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK4 = X2
& neq(sK5,nil)
& sK5 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK4 = X2
& neq(sK5,nil)
& sK5 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
=> ( ssList(sK6)
& ? [X3] :
( sK4 = sK6
& neq(sK5,nil)
& sK5 = X3
& ~ neq(X3,nil)
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( sK4 = sK6
& neq(sK5,nil)
& sK5 = X3
& ~ neq(X3,nil)
& ssList(X3) )
=> ( sK4 = sK6
& neq(sK5,nil)
& sK5 = sK7
& ~ neq(sK7,nil)
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& neq(X1,nil)
& X1 = X3
& ~ neq(X3,nil)
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f113]) ).
fof(f113,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X0 = X2
& neq(X1,nil)
& 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)
=> ( neq(X3,nil)
| X0 != X2
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X3,nil)
| X0 != X2
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f170,plain,
neq(sK7,nil),
inference(definition_unfolding,[],[f166,f165]) ).
fof(f165,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f134]) ).
fof(f166,plain,
neq(sK5,nil),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC138+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n023.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 18:45:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (22555)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 % (22566)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (22552)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52 % (22555)Instruction limit reached!
% 0.20/0.52 % (22555)------------------------------
% 0.20/0.52 % (22555)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (22555)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (22555)Termination reason: Unknown
% 0.20/0.52 % (22555)Termination phase: Preprocessing 3
% 0.20/0.52
% 0.20/0.52 % (22555)Memory used [KB]: 1535
% 0.20/0.52 % (22555)Time elapsed: 0.003 s
% 0.20/0.52 % (22555)Instructions burned: 3 (million)
% 0.20/0.52 % (22555)------------------------------
% 0.20/0.52 % (22555)------------------------------
% 0.20/0.52 % (22580)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (22559)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (22563)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.53 % (22556)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.53 % (22554)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (22561)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.53 % (22577)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.53 % (22578)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.53 % (22558)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.53 % (22566)First to succeed.
% 0.20/0.54 % (22576)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.54 % (22581)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54 % (22566)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (22566)------------------------------
% 0.20/0.54 % (22566)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (22566)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (22566)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (22566)Memory used [KB]: 6012
% 0.20/0.54 % (22566)Time elapsed: 0.005 s
% 0.20/0.54 % (22566)Instructions burned: 3 (million)
% 0.20/0.54 % (22566)------------------------------
% 0.20/0.54 % (22566)------------------------------
% 0.20/0.54 % (22549)Success in time 0.183 s
%------------------------------------------------------------------------------