TSTP Solution File: SWC019+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC019+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 : n009.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:14 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 244 ( 83 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 311 ( 115 ~; 89 |; 85 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 34 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2281,plain,
$false,
inference(avatar_sat_refutation,[],[f617,f632,f651,f774,f776,f2280]) ).
fof(f2280,plain,
( spl57_5
| spl57_8
| ~ spl57_2
| ~ spl57_9 ),
inference(avatar_split_clause,[],[f2272,f648,f595,f644,f610]) ).
fof(f610,plain,
( spl57_5
<=> nil = sK40 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_5])]) ).
fof(f644,plain,
( spl57_8
<=> neq(sK40,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_8])]) ).
fof(f595,plain,
( spl57_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_2])]) ).
fof(f648,plain,
( spl57_9
<=> ssList(sK40) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_9])]) ).
fof(f2272,plain,
( neq(sK40,nil)
| nil = sK40
| ~ spl57_2
| ~ spl57_9 ),
inference(resolution,[],[f704,f649]) ).
fof(f649,plain,
( ssList(sK40)
| ~ spl57_9 ),
inference(avatar_component_clause,[],[f648]) ).
fof(f704,plain,
( ! [X6] :
( ~ ssList(X6)
| neq(X6,nil)
| nil = X6 )
| ~ spl57_2 ),
inference(resolution,[],[f490,f596]) ).
fof(f596,plain,
( ssList(nil)
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f595]) ).
fof(f490,plain,
! [X0,X1] :
( ~ ssList(X1)
| neq(X0,X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f311]) ).
fof(f311,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f211]) ).
fof(f211,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f776,plain,
spl57_9,
inference(avatar_split_clause,[],[f494,f648]) ).
fof(f494,plain,
ssList(sK40),
inference(cnf_transformation,[],[f316]) ).
fof(f316,plain,
( ssList(sK41)
& ssList(sK43)
& sK42 = sK43
& sK41 = sK43
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK42 = sK40
& ( nil != sK40
| nil != sK41 )
& ssList(sK42)
& ssList(sK40) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK40,sK41,sK42,sK43])],[f151,f315,f314,f313,f312]) ).
fof(f312,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& X1 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X0 = X2
& ( nil != X0
| nil != X1 ) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& X1 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& sK40 = X2
& ( nil != sK40
| nil != X1 ) )
& ssList(X2) ) )
& ssList(sK40) ) ),
introduced(choice_axiom,[]) ).
fof(f313,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& X1 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& sK40 = X2
& ( nil != sK40
| nil != X1 ) )
& ssList(X2) ) )
=> ( ssList(sK41)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& sK41 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK40 = X2
& ( nil != sK40
| nil != sK41 ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f314,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& sK41 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK40 = X2
& ( nil != sK40
| nil != sK41 ) )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& sK42 = X3
& sK41 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK42 = sK40
& ( nil != sK40
| nil != sK41 ) )
& ssList(sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f315,plain,
( ? [X3] :
( ssList(X3)
& sK42 = X3
& sK41 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK42 = sK40
& ( nil != sK40
| nil != sK41 ) )
=> ( ssList(sK43)
& sK42 = sK43
& sK41 = sK43
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK40,X4)
| ~ frontsegP(sK41,X4)
| ~ ssList(X4) )
& sK42 = sK40
& ( nil != sK40
| nil != sK41 ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& X2 = X3
& X1 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& X0 = X2
& ( nil != X0
| nil != X1 ) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f150]) ).
fof(f150,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X2 = X3
& ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ ssList(X4) )
& ( nil != X0
| nil != 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
| X2 != X3
| ? [X4] :
( ssList(X4)
& frontsegP(X0,X4)
& neq(X4,nil)
& frontsegP(X1,X4) )
| ( nil = X0
& nil = X1 )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X2 != X3
| ? [X4] :
( ssList(X4)
& frontsegP(X0,X4)
& neq(X4,nil)
& frontsegP(X1,X4) )
| ( nil = X0
& nil = X1 )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f774,plain,
( spl57_6
| ~ spl57_5 ),
inference(avatar_split_clause,[],[f746,f610,f614]) ).
fof(f614,plain,
( spl57_6
<=> nil = sK41 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_6])]) ).
fof(f746,plain,
( nil = sK41
| ~ spl57_5 ),
inference(backward_demodulation,[],[f625,f611]) ).
fof(f611,plain,
( nil = sK40
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f625,plain,
sK41 = sK40,
inference(forward_demodulation,[],[f497,f618]) ).
fof(f618,plain,
sK41 = sK42,
inference(forward_demodulation,[],[f500,f499]) ).
fof(f499,plain,
sK41 = sK43,
inference(cnf_transformation,[],[f316]) ).
fof(f500,plain,
sK42 = sK43,
inference(cnf_transformation,[],[f316]) ).
fof(f497,plain,
sK42 = sK40,
inference(cnf_transformation,[],[f316]) ).
fof(f651,plain,
( ~ spl57_8
| ~ spl57_9 ),
inference(avatar_split_clause,[],[f642,f648,f644]) ).
fof(f642,plain,
( ~ ssList(sK40)
| ~ neq(sK40,nil) ),
inference(resolution,[],[f630,f634]) ).
fof(f634,plain,
frontsegP(sK40,sK40),
inference(resolution,[],[f530,f494]) ).
fof(f530,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f630,plain,
! [X4] :
( ~ frontsegP(sK40,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(duplicate_literal_removal,[],[f626]) ).
fof(f626,plain,
! [X4] :
( ~ frontsegP(sK40,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK40,X4) ),
inference(backward_demodulation,[],[f498,f625]) ).
fof(f498,plain,
! [X4] :
( ~ frontsegP(sK40,X4)
| ~ ssList(X4)
| ~ frontsegP(sK41,X4)
| ~ neq(X4,nil) ),
inference(cnf_transformation,[],[f316]) ).
fof(f632,plain,
spl57_2,
inference(avatar_split_clause,[],[f374,f595]) ).
fof(f374,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f617,plain,
( ~ spl57_5
| ~ spl57_6 ),
inference(avatar_split_clause,[],[f496,f614,f610]) ).
fof(f496,plain,
( nil != sK41
| nil != sK40 ),
inference(cnf_transformation,[],[f316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC019+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 17:54:05 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.47 % (13461)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.18/0.47 % (13441)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.48 % (13433)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)
% 0.18/0.49 % (13455)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.49 % (13443)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.50 % (13461)First to succeed.
% 0.18/0.50 % (13436)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.50 % (13461)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (13461)------------------------------
% 0.18/0.50 % (13461)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (13461)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (13461)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (13461)Memory used [KB]: 7164
% 0.18/0.50 % (13461)Time elapsed: 0.116 s
% 0.18/0.50 % (13461)Instructions burned: 66 (million)
% 0.18/0.50 % (13461)------------------------------
% 0.18/0.50 % (13461)------------------------------
% 0.18/0.50 % (13429)Success in time 0.173 s
%------------------------------------------------------------------------------