TSTP Solution File: SWC130+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC130+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 : n026.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:01 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 14 unt; 0 def)
% Number of atoms : 146 ( 35 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 159 ( 50 ~; 24 |; 66 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f651,plain,
$false,
inference(avatar_sat_refutation,[],[f580,f631,f638,f650]) ).
fof(f650,plain,
~ spl51_9,
inference(avatar_contradiction_clause,[],[f649]) ).
fof(f649,plain,
( $false
| ~ spl51_9 ),
inference(resolution,[],[f643,f367]) ).
fof(f367,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f643,plain,
( ~ cyclefreeP(nil)
| ~ spl51_9 ),
inference(backward_demodulation,[],[f534,f616]) ).
fof(f616,plain,
( nil = sK36
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f614,plain,
( spl51_9
<=> nil = sK36 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).
fof(f534,plain,
~ cyclefreeP(sK36),
inference(definition_unfolding,[],[f477,f478]) ).
fof(f478,plain,
sK34 = sK36,
inference(cnf_transformation,[],[f307]) ).
fof(f307,plain,
( ssList(sK35)
& ssList(sK36)
& sK33 = sK35
& ~ neq(sK36,nil)
& sK34 = sK36
& ~ cyclefreeP(sK34)
& ssList(sK34)
& ssList(sK33) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK33,sK34,sK35,sK36])],[f107,f306,f305,f304,f303]) ).
fof(f303,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ~ neq(X3,nil)
& X1 = X3
& ~ cyclefreeP(X1) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK33 = X2
& ~ neq(X3,nil)
& X1 = X3
& ~ cyclefreeP(X1) ) )
& ssList(X1) )
& ssList(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f304,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK33 = X2
& ~ neq(X3,nil)
& X1 = X3
& ~ cyclefreeP(X1) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK33 = X2
& ~ neq(X3,nil)
& sK34 = X3
& ~ cyclefreeP(sK34) ) )
& ssList(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f305,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK33 = X2
& ~ neq(X3,nil)
& sK34 = X3
& ~ cyclefreeP(sK34) ) )
=> ( ssList(sK35)
& ? [X3] :
( ssList(X3)
& sK33 = sK35
& ~ neq(X3,nil)
& sK34 = X3
& ~ cyclefreeP(sK34) ) ) ),
introduced(choice_axiom,[]) ).
fof(f306,plain,
( ? [X3] :
( ssList(X3)
& sK33 = sK35
& ~ neq(X3,nil)
& sK34 = X3
& ~ cyclefreeP(sK34) )
=> ( ssList(sK36)
& sK33 = sK35
& ~ neq(sK36,nil)
& sK34 = sK36
& ~ cyclefreeP(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ~ neq(X3,nil)
& X1 = X3
& ~ cyclefreeP(X1) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& X0 = X2
& ~ cyclefreeP(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)
=> ( neq(X3,nil)
| X0 != X2
| cyclefreeP(X1)
| 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
| cyclefreeP(X1)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f477,plain,
~ cyclefreeP(sK34),
inference(cnf_transformation,[],[f307]) ).
fof(f638,plain,
spl51_11,
inference(avatar_contradiction_clause,[],[f635]) ).
fof(f635,plain,
( $false
| spl51_11 ),
inference(resolution,[],[f630,f535]) ).
fof(f535,plain,
ssList(sK36),
inference(definition_unfolding,[],[f476,f478]) ).
fof(f476,plain,
ssList(sK34),
inference(cnf_transformation,[],[f307]) ).
fof(f630,plain,
( ~ ssList(sK36)
| spl51_11 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f628,plain,
( spl51_11
<=> ssList(sK36) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_11])]) ).
fof(f631,plain,
( spl51_9
| ~ spl51_1
| ~ spl51_11 ),
inference(avatar_split_clause,[],[f622,f628,f572,f614]) ).
fof(f572,plain,
( spl51_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f622,plain,
( ~ ssList(sK36)
| ~ ssList(nil)
| nil = sK36 ),
inference(resolution,[],[f394,f479]) ).
fof(f479,plain,
~ neq(sK36,nil),
inference(cnf_transformation,[],[f307]) ).
fof(f394,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f177,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) )
| ~ ssList(X0) ),
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(f580,plain,
spl51_1,
inference(avatar_split_clause,[],[f433,f572]) ).
fof(f433,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC130+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:35:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (28607)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.18/0.48 % (28597)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.18/0.49 % (28618)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.18/0.49 % (28622)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.18/0.49 % (28610)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.49 % (28620)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.18/0.50 % (28610)Instruction limit reached!
% 0.18/0.50 % (28610)------------------------------
% 0.18/0.50 % (28610)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (28610)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (28610)Termination reason: Unknown
% 0.18/0.50 % (28610)Termination phase: Naming
% 0.18/0.50
% 0.18/0.50 % (28610)Memory used [KB]: 1535
% 0.18/0.50 % (28610)Time elapsed: 0.004 s
% 0.18/0.50 % (28610)Instructions burned: 3 (million)
% 0.18/0.50 % (28610)------------------------------
% 0.18/0.50 % (28610)------------------------------
% 0.18/0.50 % (28607)Instruction limit reached!
% 0.18/0.50 % (28607)------------------------------
% 0.18/0.50 % (28607)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (28602)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.18/0.50 % (28604)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.18/0.50 % (28614)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.50 % (28607)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (28607)Termination reason: Unknown
% 0.18/0.50 % (28607)Termination phase: Saturation
% 0.18/0.50
% 0.18/0.50 % (28607)Memory used [KB]: 6140
% 0.18/0.50 % (28607)Time elapsed: 0.102 s
% 0.18/0.50 % (28607)Instructions burned: 7 (million)
% 0.18/0.50 % (28607)------------------------------
% 0.18/0.50 % (28607)------------------------------
% 0.18/0.50 % (28618)First to succeed.
% 0.18/0.50 % (28614)Instruction limit reached!
% 0.18/0.50 % (28614)------------------------------
% 0.18/0.50 % (28614)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (28597)Also succeeded, but the first one will report.
% 0.18/0.50 % (28614)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (28614)Termination reason: Unknown
% 0.18/0.50 % (28614)Termination phase: SInE selection
% 0.18/0.50
% 0.18/0.50 % (28614)Memory used [KB]: 1407
% 0.18/0.50 % (28614)Time elapsed: 0.004 s
% 0.18/0.50 % (28614)Instructions burned: 2 (million)
% 0.18/0.50 % (28614)------------------------------
% 0.18/0.50 % (28614)------------------------------
% 0.18/0.51 % (28618)Refutation found. Thanks to Tanya!
% 0.18/0.51 % SZS status Theorem for theBenchmark
% 0.18/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51 % (28618)------------------------------
% 0.18/0.51 % (28618)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (28618)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (28618)Termination reason: Refutation
% 0.18/0.51
% 0.18/0.51 % (28618)Memory used [KB]: 6396
% 0.18/0.51 % (28618)Time elapsed: 0.072 s
% 0.18/0.51 % (28618)Instructions burned: 12 (million)
% 0.18/0.51 % (28618)------------------------------
% 0.18/0.51 % (28618)------------------------------
% 0.18/0.51 % (28595)Success in time 0.167 s
%------------------------------------------------------------------------------