TSTP Solution File: SWC135+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC135+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 : n022.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:57 EDT 2022
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 140 ( 35 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 157 ( 50 ~; 24 |; 66 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 41 ( 17 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f643,plain,
$false,
inference(avatar_sat_refutation,[],[f611,f641]) ).
fof(f641,plain,
~ spl57_2,
inference(avatar_contradiction_clause,[],[f640]) ).
fof(f640,plain,
( $false
| ~ spl57_2 ),
inference(subsumption_resolution,[],[f637,f505]) ).
fof(f505,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax60) ).
fof(f637,plain,
( ~ cyclefreeP(nil)
| ~ spl57_2 ),
inference(backward_demodulation,[],[f556,f634]) ).
fof(f634,plain,
( nil = sK40
| ~ spl57_2 ),
inference(subsumption_resolution,[],[f632,f555]) ).
fof(f555,plain,
ssList(sK40),
inference(definition_unfolding,[],[f485,f481]) ).
fof(f481,plain,
sK38 = sK40,
inference(cnf_transformation,[],[f310]) ).
fof(f310,plain,
( ssList(sK38)
& ~ neq(sK40,nil)
& ~ cyclefreeP(sK38)
& sK37 = sK39
& sK38 = sK40
& ssList(sK40)
& ssList(sK39)
& ssList(sK37) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK37,sK38,sK39,sK40])],[f220,f309,f308,f307,f306]) ).
fof(f306,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& sK37 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f307,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& sK37 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK38)
& ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK38)
& sK37 = X2
& sK38 = X3
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f308,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK38)
& sK37 = X2
& sK38 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK38)
& sK37 = sK39
& sK38 = X3
& ssList(X3) )
& ssList(sK39) ) ),
introduced(choice_axiom,[]) ).
fof(f309,plain,
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(sK38)
& sK37 = sK39
& sK38 = X3
& ssList(X3) )
=> ( ~ neq(sK40,nil)
& ~ cyclefreeP(sK38)
& sK37 = sK39
& sK38 = sK40
& ssList(sK40) ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f219]) ).
fof(f219,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ neq(X3,nil)
& ~ 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)
=> ( X0 != X2
| neq(X3,nil)
| cyclefreeP(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(X3,nil)
| cyclefreeP(X1)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f485,plain,
ssList(sK38),
inference(cnf_transformation,[],[f310]) ).
fof(f632,plain,
( nil = sK40
| ~ ssList(sK40)
| ~ spl57_2 ),
inference(resolution,[],[f629,f484]) ).
fof(f484,plain,
~ neq(sK40,nil),
inference(cnf_transformation,[],[f310]) ).
fof(f629,plain,
( ! [X0] :
( neq(X0,nil)
| ~ ssList(X0)
| nil = X0 )
| ~ spl57_2 ),
inference(resolution,[],[f598,f453]) ).
fof(f453,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 = X1
| ~ ssList(X0)
| neq(X0,X1) ),
inference(cnf_transformation,[],[f293]) ).
fof(f293,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f598,plain,
( ssList(nil)
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f597,plain,
( spl57_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_2])]) ).
fof(f556,plain,
~ cyclefreeP(sK40),
inference(definition_unfolding,[],[f483,f481]) ).
fof(f483,plain,
~ cyclefreeP(sK38),
inference(cnf_transformation,[],[f310]) ).
fof(f611,plain,
spl57_2,
inference(avatar_split_clause,[],[f375,f597]) ).
fof(f375,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC135+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n022.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:23:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.47 % (30388)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49 % (30413)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.49 % (30384)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.18/0.50 % (30408)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.18/0.50 % (30399)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.18/0.50 % (30404)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.18/0.50 % (30391)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.51 % (30396)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.18/0.51 % (30393)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.18/0.51 % (30391)Instruction limit reached!
% 0.18/0.51 % (30391)------------------------------
% 0.18/0.51 % (30391)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (30391)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (30391)Termination reason: Unknown
% 0.18/0.51 % (30391)Termination phase: Property scanning
% 0.18/0.51
% 0.18/0.51 % (30391)Memory used [KB]: 1279
% 0.18/0.51 % (30391)Time elapsed: 0.008 s
% 0.18/0.51 % (30391)Instructions burned: 7 (million)
% 0.18/0.51 % (30391)------------------------------
% 0.18/0.51 % (30391)------------------------------
% 0.18/0.51 % (30410)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.52 % (30386)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.18/0.52 % (30408)First to succeed.
% 0.18/0.52 % (30389)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.52 % (30390)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.52 % (30408)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (30408)------------------------------
% 0.18/0.52 % (30408)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (30408)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (30408)Termination reason: Refutation
% 0.18/0.52
% 0.18/0.52 % (30408)Memory used [KB]: 5884
% 0.18/0.52 % (30408)Time elapsed: 0.080 s
% 0.18/0.52 % (30408)Instructions burned: 18 (million)
% 0.18/0.52 % (30408)------------------------------
% 0.18/0.52 % (30408)------------------------------
% 0.18/0.52 % (30379)Success in time 0.177 s
%------------------------------------------------------------------------------