TSTP Solution File: SWC359+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC359+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 : n029.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:40:42 EDT 2022
% Result : Theorem 1.27s 0.52s
% Output : Refutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 190 ( 28 equ)
% Maximal formula atoms : 30 ( 11 avg)
% Number of connectives : 253 ( 79 ~; 56 |; 106 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 45 ( 19 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f631,plain,
$false,
inference(subsumption_resolution,[],[f561,f558]) ).
fof(f558,plain,
segmentP(sK19,sK20),
inference(definition_unfolding,[],[f415,f412]) ).
fof(f412,plain,
sK21 = sK19,
inference(cnf_transformation,[],[f265]) ).
fof(f265,plain,
( sK18 = sK20
& segmentP(sK21,sK20)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(sK21,X4)
| ~ segmentP(X4,sK20)
| ~ neq(sK20,X4)
| ~ ssList(X4) )
& ssList(sK21)
& sK21 = sK19
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(sK20)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f169,f264,f263,f262,f261]) ).
fof(f261,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& X1 = X3
& ~ segmentP(X1,X0)
& neq(X1,nil)
& equalelemsP(X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK18 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& X1 = X3
& ~ segmentP(X1,sK18)
& neq(X1,nil)
& equalelemsP(X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK18 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& X1 = X3
& ~ segmentP(X1,sK18)
& neq(X1,nil)
& equalelemsP(X2) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK18 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& sK19 = X3
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(X2) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f263,plain,
( ? [X2] :
( ? [X3] :
( sK18 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& sK19 = X3
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(X2) )
& ssList(X2) )
=> ( ? [X3] :
( sK18 = sK20
& segmentP(X3,sK20)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK20)
| ~ neq(sK20,X4)
| ~ ssList(X4) )
& ssList(X3)
& sK19 = X3
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(sK20) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f264,plain,
( ? [X3] :
( sK18 = sK20
& segmentP(X3,sK20)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK20)
| ~ neq(sK20,X4)
| ~ ssList(X4) )
& ssList(X3)
& sK19 = X3
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(sK20) )
=> ( sK18 = sK20
& segmentP(sK21,sK20)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(sK21,X4)
| ~ segmentP(X4,sK20)
| ~ neq(sK20,X4)
| ~ ssList(X4) )
& ssList(sK21)
& sK21 = sK19
& ~ segmentP(sK19,sK18)
& neq(sK19,nil)
& equalelemsP(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& segmentP(X3,X2)
& ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ssList(X3)
& X1 = X3
& ~ segmentP(X1,X0)
& neq(X1,nil)
& equalelemsP(X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f168]) ).
fof(f168,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& segmentP(X3,X2)
& ~ segmentP(X1,X0)
& neq(X1,nil)
& X1 = X3
& equalelemsP(X2)
& X0 = X2
& 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)
=> ( ? [X4] :
( segmentP(X3,X4)
& ssList(X4)
& equalelemsP(X4)
& neq(X2,X4)
& segmentP(X4,X2) )
| ~ segmentP(X3,X2)
| segmentP(X1,X0)
| ~ neq(X1,nil)
| X1 != X3
| ~ equalelemsP(X2)
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( segmentP(X3,X4)
& ssList(X4)
& equalelemsP(X4)
& neq(X2,X4)
& segmentP(X4,X2) )
| ~ segmentP(X3,X2)
| segmentP(X1,X0)
| ~ neq(X1,nil)
| X1 != X3
| ~ equalelemsP(X2)
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f415,plain,
segmentP(sK21,sK20),
inference(cnf_transformation,[],[f265]) ).
fof(f561,plain,
~ segmentP(sK19,sK20),
inference(definition_unfolding,[],[f411,f416]) ).
fof(f416,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f265]) ).
fof(f411,plain,
~ segmentP(sK19,sK18),
inference(cnf_transformation,[],[f265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC359+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_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n029.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 19:00:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (12067)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.50 % (12085)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.19/0.50 % (12067)First to succeed.
% 0.19/0.51 % (12071)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (12072)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51 % (12075)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.19/0.51 % (12078)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.19/0.51 % (12076)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51 % (12074)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.27/0.52 % (12077)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.27/0.52 % (12090)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.27/0.52 % (12089)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)
% 1.27/0.52 % (12067)Refutation found. Thanks to Tanya!
% 1.27/0.52 % SZS status Theorem for theBenchmark
% 1.27/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.27/0.52 % (12067)------------------------------
% 1.27/0.52 % (12067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.27/0.52 % (12067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.27/0.52 % (12067)Termination reason: Refutation
% 1.27/0.52
% 1.27/0.52 % (12067)Memory used [KB]: 6396
% 1.27/0.52 % (12067)Time elapsed: 0.101 s
% 1.27/0.52 % (12067)Instructions burned: 11 (million)
% 1.27/0.52 % (12067)------------------------------
% 1.27/0.52 % (12067)------------------------------
% 1.27/0.52 % (12066)Success in time 0.174 s
%------------------------------------------------------------------------------