TSTP Solution File: SWC133+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC133+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 : n011.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:02 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 123 ( 33 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 138 ( 41 ~; 15 |; 66 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 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 : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f170,plain,
$false,
inference(subsumption_resolution,[],[f167,f132]) ).
fof(f132,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f167,plain,
~ cyclefreeP(nil),
inference(backward_demodulation,[],[f130,f163]) ).
fof(f163,plain,
nil = sK3,
inference(unit_resulting_resolution,[],[f150,f156,f158,f134]) ).
fof(f134,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f158,plain,
~ neq(sK3,nil),
inference(forward_demodulation,[],[f131,f129]) ).
fof(f129,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
( ~ neq(sK5,nil)
& ~ cyclefreeP(sK3)
& sK5 = sK3
& sK4 = sK2
& ssList(sK5)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f100,f111,f110,f109,f108]) ).
fof(f108,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X1 = X3
& sK2 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X1 = X3
& sK2 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK3)
& sK3 = X3
& sK2 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK3)
& sK3 = X3
& sK2 = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK3)
& sK3 = X3
& sK4 = sK2
& ssList(X3) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK3)
& sK3 = X3
& sK4 = sK2
& ssList(X3) )
=> ( ~ neq(sK5,nil)
& ~ cyclefreeP(sK3)
& sK5 = sK3
& sK4 = sK2
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& X0 = X2
& ~ neq(X3,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)
=> ( cyclefreeP(X1)
| X0 != X2
| neq(X3,nil)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| X0 != X2
| neq(X3,nil)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f131,plain,
~ neq(sK5,nil),
inference(cnf_transformation,[],[f112]) ).
fof(f156,plain,
ssList(sK3),
inference(backward_demodulation,[],[f127,f129]) ).
fof(f127,plain,
ssList(sK5),
inference(cnf_transformation,[],[f112]) ).
fof(f150,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f130,plain,
~ cyclefreeP(sK3),
inference(cnf_transformation,[],[f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC133+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:19:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (859)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.52 % (857)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 % (857)First to succeed.
% 0.20/0.52 % (862)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.52 % (875)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (859)Also succeeded, but the first one will report.
% 0.20/0.53 % (879)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.53 % (857)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (857)------------------------------
% 0.20/0.53 % (857)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (857)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (857)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (857)Memory used [KB]: 6012
% 0.20/0.53 % (857)Time elapsed: 0.107 s
% 0.20/0.53 % (857)Instructions burned: 3 (million)
% 0.20/0.53 % (857)------------------------------
% 0.20/0.53 % (857)------------------------------
% 0.20/0.53 % (853)Success in time 0.171 s
%------------------------------------------------------------------------------