TSTP Solution File: SWC361+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC361+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:43:22 EDT 2022
% Result : Theorem 1.77s 0.59s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 189 ( 28 equ)
% Maximal formula atoms : 30 ( 12 avg)
% Number of connectives : 252 ( 78 ~; 56 |; 106 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 11 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(f597,plain,
$false,
inference(subsumption_resolution,[],[f559,f548]) ).
fof(f548,plain,
~ segmentP(sK54,sK53),
inference(cnf_transformation,[],[f345]) ).
fof(f345,plain,
( ssList(sK53)
& strictorderedP(sK55)
& segmentP(sK56,sK55)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ segmentP(X4,sK55) )
& sK56 = sK54
& sK55 = sK53
& ssList(sK56)
& neq(sK54,nil)
& ssList(sK55)
& ssList(sK54) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f158,f344,f343,f342,f341]) ).
fof(f341,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(X1,X0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& X1 = X3
& X0 = X2
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK53)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(X1,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& X1 = X3
& sK53 = X2
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(X1,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& X1 = X3
& sK53 = X2
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& sK54 = X3
& sK53 = X2
& ssList(X3)
& neq(sK54,nil) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& sK54 = X3
& sK53 = X2
& ssList(X3)
& neq(sK54,nil) )
& ssList(X2) )
=> ( ? [X3] :
( strictorderedP(sK55)
& segmentP(X3,sK55)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK55) )
& sK54 = X3
& sK55 = sK53
& ssList(X3)
& neq(sK54,nil) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X3] :
( strictorderedP(sK55)
& segmentP(X3,sK55)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK55) )
& sK54 = X3
& sK55 = sK53
& ssList(X3)
& neq(sK54,nil) )
=> ( strictorderedP(sK55)
& segmentP(sK56,sK55)
& ~ segmentP(sK54,sK53)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ segmentP(X4,sK55) )
& sK56 = sK54
& sK55 = sK53
& ssList(sK56)
& neq(sK54,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( strictorderedP(X2)
& segmentP(X3,X2)
& ~ segmentP(X1,X0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& X1 = X3
& X0 = X2
& ssList(X3)
& neq(X1,nil) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f157]) ).
fof(f157,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& strictorderedP(X2)
& segmentP(X3,X2)
& X1 = X3
& ! [X4] :
( ~ strictorderedP(X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2) )
& X0 = X2
& ~ segmentP(X1,X0)
& 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(X1,nil)
| ~ strictorderedP(X2)
| ~ segmentP(X3,X2)
| X1 != X3
| ? [X4] :
( ssList(X4)
& segmentP(X3,X4)
& neq(X2,X4)
& strictorderedP(X4)
& segmentP(X4,X2) )
| X0 != X2
| segmentP(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| ~ strictorderedP(X2)
| ~ segmentP(X3,X2)
| X1 != X3
| ? [X4] :
( ssList(X4)
& segmentP(X3,X4)
& neq(X2,X4)
& strictorderedP(X4)
& segmentP(X4,X2) )
| X0 != X2
| segmentP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f559,plain,
segmentP(sK54,sK53),
inference(definition_unfolding,[],[f549,f546,f545]) ).
fof(f545,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f345]) ).
fof(f546,plain,
sK56 = sK54,
inference(cnf_transformation,[],[f345]) ).
fof(f549,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f345]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC361+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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 : n009.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:48:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.54 % (24578)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (24577)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.20/0.55 % (24594)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.20/0.56 % (24578)Instruction limit reached!
% 0.20/0.56 % (24578)------------------------------
% 0.20/0.56 % (24578)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (24593)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.20/0.56 % (24586)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)
% 1.50/0.56 % (24585)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.50/0.58 % (24593)First to succeed.
% 1.50/0.58 % (24578)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.58 % (24578)Termination reason: Unknown
% 1.50/0.58 % (24578)Termination phase: Function definition elimination
% 1.50/0.58
% 1.50/0.58 % (24578)Memory used [KB]: 1279
% 1.50/0.58 % (24578)Time elapsed: 0.008 s
% 1.50/0.58 % (24578)Instructions burned: 8 (million)
% 1.50/0.58 % (24578)------------------------------
% 1.50/0.58 % (24578)------------------------------
% 1.77/0.58 TRYING [1]
% 1.77/0.59 TRYING [2]
% 1.77/0.59 % (24594)Also succeeded, but the first one will report.
% 1.77/0.59 % (24593)Refutation found. Thanks to Tanya!
% 1.77/0.59 % SZS status Theorem for theBenchmark
% 1.77/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.77/0.59 % (24593)------------------------------
% 1.77/0.59 % (24593)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.77/0.59 % (24593)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.77/0.59 % (24593)Termination reason: Refutation
% 1.77/0.59
% 1.77/0.59 % (24593)Memory used [KB]: 1407
% 1.77/0.59 % (24593)Time elapsed: 0.155 s
% 1.77/0.59 % (24593)Instructions burned: 11 (million)
% 1.77/0.59 % (24593)------------------------------
% 1.77/0.59 % (24593)------------------------------
% 1.77/0.59 % (24570)Success in time 0.235 s
%------------------------------------------------------------------------------