TSTP Solution File: SWC208+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC208+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 : n015.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:42:24 EDT 2022
% Result : Theorem 1.44s 0.57s
% Output : Refutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 185 ( 61 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 193 ( 39 ~; 39 |; 100 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f660,plain,
$false,
inference(avatar_sat_refutation,[],[f646,f651,f652,f659]) ).
fof(f659,plain,
( ~ spl57_7
| spl57_10
| ~ spl57_11 ),
inference(avatar_contradiction_clause,[],[f658]) ).
fof(f658,plain,
( $false
| ~ spl57_7
| spl57_10
| ~ spl57_11 ),
inference(subsumption_resolution,[],[f656,f654]) ).
fof(f654,plain,
( neq(nil,nil)
| ~ spl57_7 ),
inference(backward_demodulation,[],[f440,f631]) ).
fof(f631,plain,
( nil = sK24
| ~ spl57_7 ),
inference(avatar_component_clause,[],[f629]) ).
fof(f629,plain,
( spl57_7
<=> nil = sK24 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_7])]) ).
fof(f440,plain,
neq(sK24,nil),
inference(cnf_transformation,[],[f280]) ).
fof(f280,plain,
( ssList(sK24)
& ssList(sK25)
& ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(sK26)
& sK26 = sK24
& ( ( frontsegP(sK26,sK25)
& neq(sK25,nil) )
| ( nil = sK26
& nil = sK25 ) )
& sK23 = sK25
& ssList(sK23) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK23,sK24,sK25,sK26])],[f144,f279,f278,f277,f276]) ).
fof(f276,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X0 = X2 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK23,nil)
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK23 = X2 ) ) )
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f277,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK23,nil)
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK23 = X2 ) ) )
=> ( ssList(sK24)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(X3)
& sK24 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK23 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f278,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(X3)
& sK24 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK23 = X2 ) )
=> ( ssList(sK25)
& ? [X3] :
( ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(X3)
& sK24 = X3
& ( ( frontsegP(X3,sK25)
& neq(sK25,nil) )
| ( nil = X3
& nil = sK25 ) )
& sK23 = sK25 ) ) ),
introduced(choice_axiom,[]) ).
fof(f279,plain,
( ? [X3] :
( ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(X3)
& sK24 = X3
& ( ( frontsegP(X3,sK25)
& neq(sK25,nil) )
| ( nil = X3
& nil = sK25 ) )
& sK23 = sK25 )
=> ( ~ neq(sK23,nil)
& neq(sK24,nil)
& ssList(sK26)
& sK26 = sK24
& ( ( frontsegP(sK26,sK25)
& neq(sK25,nil) )
| ( nil = sK26
& nil = sK25 ) )
& sK23 = sK25 ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X0 = X2 ) ) )
& ssList(X0) ),
inference(flattening,[],[f143]) ).
fof(f143,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& X0 = X2
& X1 = X3
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& neq(X1,nil)
& 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(X0,nil)
| X0 != X2
| X1 != X3
| ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ~ neq(X1,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| X0 != X2
| X1 != X3
| ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ~ neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f656,plain,
( ~ neq(nil,nil)
| spl57_10
| ~ spl57_11 ),
inference(backward_demodulation,[],[f644,f650]) ).
fof(f650,plain,
( nil = sK25
| ~ spl57_11 ),
inference(avatar_component_clause,[],[f648]) ).
fof(f648,plain,
( spl57_11
<=> nil = sK25 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_11])]) ).
fof(f644,plain,
( ~ neq(sK25,nil)
| spl57_10 ),
inference(avatar_component_clause,[],[f643]) ).
fof(f643,plain,
( spl57_10
<=> neq(sK25,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_10])]) ).
fof(f652,plain,
~ spl57_10,
inference(avatar_split_clause,[],[f559,f643]) ).
fof(f559,plain,
~ neq(sK25,nil),
inference(definition_unfolding,[],[f441,f433]) ).
fof(f433,plain,
sK23 = sK25,
inference(cnf_transformation,[],[f280]) ).
fof(f441,plain,
~ neq(sK23,nil),
inference(cnf_transformation,[],[f280]) ).
fof(f651,plain,
( spl57_11
| spl57_10 ),
inference(avatar_split_clause,[],[f434,f643,f648]) ).
fof(f434,plain,
( neq(sK25,nil)
| nil = sK25 ),
inference(cnf_transformation,[],[f280]) ).
fof(f646,plain,
( spl57_10
| spl57_7 ),
inference(avatar_split_clause,[],[f563,f629,f643]) ).
fof(f563,plain,
( nil = sK24
| neq(sK25,nil) ),
inference(definition_unfolding,[],[f435,f438]) ).
fof(f438,plain,
sK26 = sK24,
inference(cnf_transformation,[],[f280]) ).
fof(f435,plain,
( neq(sK25,nil)
| nil = sK26 ),
inference(cnf_transformation,[],[f280]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC208+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.14/0.35 % Computer : n015.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:46:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.27/0.52 % (5710)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)
% 1.44/0.56 % (5729)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.44/0.56 % (5707)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)
% 1.44/0.56 % (5711)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)
% 1.44/0.56 % (5721)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.44/0.56 % (5725)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)
% 1.44/0.56 % (5706)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.44/0.56 % (5719)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.44/0.57 % (5708)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.44/0.57 % (5718)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.44/0.57 % (5714)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)
% 1.44/0.57 % (5710)First to succeed.
% 1.44/0.57 % (5710)Refutation found. Thanks to Tanya!
% 1.44/0.57 % SZS status Theorem for theBenchmark
% 1.44/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.57 % (5710)------------------------------
% 1.44/0.57 % (5710)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.57 % (5710)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.57 % (5710)Termination reason: Refutation
% 1.44/0.57
% 1.44/0.57 % (5710)Memory used [KB]: 5884
% 1.44/0.57 % (5710)Time elapsed: 0.150 s
% 1.44/0.57 % (5710)Instructions burned: 13 (million)
% 1.44/0.57 % (5710)------------------------------
% 1.44/0.57 % (5710)------------------------------
% 1.44/0.57 % (5704)Success in time 0.213 s
%------------------------------------------------------------------------------