TSTP Solution File: SWC059+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC059+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 : n016.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:27 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 7 unt; 0 def)
% Number of atoms : 309 ( 107 equ)
% Maximal formula atoms : 36 ( 7 avg)
% Number of connectives : 415 ( 150 ~; 131 |; 121 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 52 ( 26 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f678,plain,
$false,
inference(subsumption_resolution,[],[f671,f648]) ).
fof(f648,plain,
nil != sK19,
inference(subsumption_resolution,[],[f643,f420]) ).
fof(f420,plain,
ssList(sK19),
inference(cnf_transformation,[],[f265]) ).
fof(f265,plain,
( ssList(sK18)
& ( ~ neq(sK20,nil)
| ( segmentP(sK20,sK19)
& neq(sK19,nil) ) )
& sK17 = sK19
& ( nil = sK19
| nil != sK20 )
& sK20 = sK18
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(sK20)
& ssList(sK19)
& ssList(sK17) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18,sK19,sK20])],[f197,f264,f263,f262,f261]) ).
fof(f261,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& X0 = X2
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) ) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& sK17 = X2
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ( nil = X1
& nil != sK17 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& sK17 = X2
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ( nil = X1
& nil != sK17 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK18)
& ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& sK17 = X2
& ( nil = X2
| nil != X3 )
& sK18 = X3
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f263,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& sK17 = X2
& ( nil = X2
| nil != X3 )
& sK18 = X3
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,sK19)
& neq(sK19,nil) ) )
& sK17 = sK19
& ( nil = sK19
| nil != X3 )
& sK18 = X3
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f264,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,sK19)
& neq(sK19,nil) ) )
& sK17 = sK19
& ( nil = sK19
| nil != X3 )
& sK18 = X3
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(X3) )
=> ( ( ~ neq(sK20,nil)
| ( segmentP(sK20,sK19)
& neq(sK19,nil) ) )
& sK17 = sK19
& ( nil = sK19
| nil != sK20 )
& sK20 = sK18
& ( ( nil = sK18
& nil != sK17 )
| ( neq(sK18,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ) ) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f197,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& X0 = X2
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) ) ) )
& ssList(X3) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f196]) ).
fof(f196,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( segmentP(X3,X2)
& neq(X2,nil) ) )
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ ssList(X4)
| ~ segmentP(X0,X4) ) ) )
& 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)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| X0 != X2
| ( nil = X3
& nil != X2 )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& neq(X4,nil)
& segmentP(X0,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)
=> ( ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) )
| X0 != X2
| ( nil = X3
& nil != X2 )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& neq(X4,nil)
& segmentP(X0,X4) ) )
& ( nil = X0
| nil != X1 ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f643,plain,
( nil != sK19
| ~ ssList(sK19) ),
inference(resolution,[],[f496,f624]) ).
fof(f624,plain,
( ~ segmentP(sK19,sK19)
| nil != sK19 ),
inference(subsumption_resolution,[],[f623,f605]) ).
fof(f605,plain,
( segmentP(sK18,sK19)
| nil != sK19 ),
inference(resolution,[],[f564,f560]) ).
fof(f560,plain,
( ~ neq(sK18,nil)
| segmentP(sK18,sK19) ),
inference(definition_unfolding,[],[f430,f426,f426]) ).
fof(f426,plain,
sK20 = sK18,
inference(cnf_transformation,[],[f265]) ).
fof(f430,plain,
( ~ neq(sK20,nil)
| segmentP(sK20,sK19) ),
inference(cnf_transformation,[],[f265]) ).
fof(f564,plain,
( neq(sK18,nil)
| nil != sK19 ),
inference(definition_unfolding,[],[f423,f428]) ).
fof(f428,plain,
sK17 = sK19,
inference(cnf_transformation,[],[f265]) ).
fof(f423,plain,
( nil != sK17
| neq(sK18,nil) ),
inference(cnf_transformation,[],[f265]) ).
fof(f623,plain,
( nil != sK19
| ~ segmentP(sK19,sK19)
| ~ segmentP(sK18,sK19) ),
inference(subsumption_resolution,[],[f622,f564]) ).
fof(f622,plain,
( ~ segmentP(sK18,sK19)
| ~ neq(sK18,nil)
| nil != sK19
| ~ segmentP(sK19,sK19) ),
inference(subsumption_resolution,[],[f620,f420]) ).
fof(f620,plain,
( ~ segmentP(sK19,sK19)
| nil != sK19
| ~ neq(sK18,nil)
| ~ ssList(sK19)
| ~ segmentP(sK18,sK19) ),
inference(resolution,[],[f565,f561]) ).
fof(f561,plain,
( neq(sK19,nil)
| ~ neq(sK18,nil) ),
inference(definition_unfolding,[],[f429,f426]) ).
fof(f429,plain,
( ~ neq(sK20,nil)
| neq(sK19,nil) ),
inference(cnf_transformation,[],[f265]) ).
fof(f565,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ segmentP(sK19,X4)
| nil != sK19
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f422,f428,f428]) ).
fof(f422,plain,
! [X4] :
( nil != sK17
| ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ),
inference(cnf_transformation,[],[f265]) ).
fof(f496,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f195]) ).
fof(f195,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f671,plain,
nil = sK19,
inference(trivial_inequality_removal,[],[f657]) ).
fof(f657,plain,
( nil = sK19
| nil != nil ),
inference(backward_demodulation,[],[f562,f650]) ).
fof(f650,plain,
nil = sK18,
inference(subsumption_resolution,[],[f644,f420]) ).
fof(f644,plain,
( ~ ssList(sK19)
| nil = sK18 ),
inference(resolution,[],[f496,f615]) ).
fof(f615,plain,
( ~ segmentP(sK19,sK19)
| nil = sK18 ),
inference(subsumption_resolution,[],[f614,f425]) ).
fof(f425,plain,
( neq(sK18,nil)
| nil = sK18 ),
inference(cnf_transformation,[],[f265]) ).
fof(f614,plain,
( nil = sK18
| ~ neq(sK18,nil)
| ~ segmentP(sK19,sK19) ),
inference(subsumption_resolution,[],[f613,f560]) ).
fof(f613,plain,
( ~ segmentP(sK19,sK19)
| nil = sK18
| ~ neq(sK18,nil)
| ~ segmentP(sK18,sK19) ),
inference(subsumption_resolution,[],[f611,f420]) ).
fof(f611,plain,
( ~ neq(sK18,nil)
| ~ segmentP(sK18,sK19)
| ~ ssList(sK19)
| ~ segmentP(sK19,sK19)
| nil = sK18 ),
inference(resolution,[],[f563,f561]) ).
fof(f563,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK19,X4)
| ~ ssList(X4)
| nil = sK18
| ~ segmentP(sK18,X4) ),
inference(definition_unfolding,[],[f424,f428]) ).
fof(f424,plain,
! [X4] :
( nil = sK18
| ~ neq(X4,nil)
| ~ segmentP(sK18,X4)
| ~ ssList(X4)
| ~ segmentP(sK17,X4) ),
inference(cnf_transformation,[],[f265]) ).
fof(f562,plain,
( nil = sK19
| nil != sK18 ),
inference(definition_unfolding,[],[f427,f426]) ).
fof(f427,plain,
( nil = sK19
| nil != sK20 ),
inference(cnf_transformation,[],[f265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC059+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.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:26:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (1204)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.49 % (1196)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)
% 0.19/0.50 % (1188)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.19/0.51 % (1190)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51 % (1190)Instruction limit reached!
% 0.19/0.51 % (1190)------------------------------
% 0.19/0.51 % (1190)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (1190)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (1190)Termination reason: Unknown
% 0.19/0.51 % (1190)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (1190)Memory used [KB]: 1023
% 0.19/0.51 % (1190)Time elapsed: 0.003 s
% 0.19/0.51 % (1190)Instructions burned: 3 (million)
% 0.19/0.51 % (1190)------------------------------
% 0.19/0.51 % (1190)------------------------------
% 0.19/0.51 % (1204)First to succeed.
% 0.19/0.52 % (1204)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (1204)------------------------------
% 0.19/0.52 % (1204)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (1204)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (1204)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (1204)Memory used [KB]: 1407
% 0.19/0.52 % (1204)Time elapsed: 0.069 s
% 0.19/0.52 % (1204)Instructions burned: 14 (million)
% 0.19/0.52 % (1204)------------------------------
% 0.19/0.52 % (1204)------------------------------
% 0.19/0.52 % (1181)Success in time 0.168 s
%------------------------------------------------------------------------------