TSTP Solution File: SWC294+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC294+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 : 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:42:57 EDT 2022
% Result : Theorem 1.51s 0.58s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 74 ( 23 unt; 3 typ; 0 def)
% Number of atoms : 264 ( 66 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 289 ( 96 ~; 89 |; 82 &)
% ( 6 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 40 !; 25 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_27,type,
sQ58_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_28,type,
sQ59_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_29,type,
sQ60_eqProxy: ( $real * $real ) > $o ).
fof(f1536,plain,
$false,
inference(subsumption_resolution,[],[f1499,f688]) ).
fof(f688,plain,
strictorderedP(nil),
inference(literal_reordering,[],[f458]) ).
fof(f458,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f1499,plain,
~ strictorderedP(nil),
inference(backward_demodulation,[],[f775,f1493]) ).
fof(f1493,plain,
nil = sK53,
inference(subsumption_resolution,[],[f1486,f656]) ).
fof(f656,plain,
ssList(sK53),
inference(literal_reordering,[],[f558]) ).
fof(f558,plain,
ssList(sK53),
inference(definition_unfolding,[],[f542,f546]) ).
fof(f546,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f344]) ).
fof(f344,plain,
( sK56 = sK54
& ( ~ neq(sK56,nil)
| singletonP(sK55) )
& sK55 = sK53
& ssList(sK56)
& ~ strictorderedP(sK53)
& segmentP(sK56,sK55)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f177,f343,f342,f341,f340]) ).
fof(f340,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& X0 = X2
& ssList(X3)
& ~ strictorderedP(X0)
& segmentP(X3,X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& sK53 = X2
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f341,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& sK53 = X2
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,X2) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK54 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& sK53 = X2
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,X2) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X2] :
( ? [X3] :
( sK54 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& sK53 = X2
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,X2) )
& ssList(X2) )
=> ( ? [X3] :
( sK54 = X3
& ( ~ neq(X3,nil)
| singletonP(sK55) )
& sK55 = sK53
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,sK55) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X3] :
( sK54 = X3
& ( ~ neq(X3,nil)
| singletonP(sK55) )
& sK55 = sK53
& ssList(X3)
& ~ strictorderedP(sK53)
& segmentP(X3,sK55) )
=> ( sK56 = sK54
& ( ~ neq(sK56,nil)
| singletonP(sK55) )
& sK55 = sK53
& ssList(sK56)
& ~ strictorderedP(sK53)
& segmentP(sK56,sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& X0 = X2
& ssList(X3)
& ~ strictorderedP(X0)
& segmentP(X3,X2) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ~ singletonP(X2)
& neq(X3,nil) )
| strictorderedP(X0)
| X0 != X2
| ~ ssList(X3)
| ~ segmentP(X3,X2)
| X1 != X3 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ~ singletonP(X2)
& neq(X3,nil) )
| strictorderedP(X0)
| X0 != X2
| ~ ssList(X3)
| ~ segmentP(X3,X2)
| X1 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f542,plain,
ssList(sK55),
inference(cnf_transformation,[],[f344]) ).
fof(f1486,plain,
( nil = sK53
| ~ ssList(sK53) ),
inference(resolution,[],[f1472,f586]) ).
fof(f586,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(literal_reordering,[],[f454]) ).
fof(f454,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f289]) ).
fof(f289,plain,
! [X0] :
( ~ ssList(X0)
| ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f1472,plain,
segmentP(nil,sK53),
inference(backward_demodulation,[],[f630,f1451]) ).
fof(f1451,plain,
nil = sK54,
inference(subsumption_resolution,[],[f1450,f1222]) ).
fof(f1222,plain,
( ssItem(sK41(sK53))
| nil = sK54 ),
inference(subsumption_resolution,[],[f1221,f725]) ).
fof(f725,plain,
ssList(sK54),
inference(literal_reordering,[],[f541]) ).
fof(f541,plain,
ssList(sK54),
inference(cnf_transformation,[],[f344]) ).
fof(f1221,plain,
( ~ ssList(sK54)
| nil = sK54
| ssItem(sK41(sK53)) ),
inference(subsumption_resolution,[],[f1216,f753]) ).
fof(f753,plain,
ssList(nil),
inference(literal_reordering,[],[f348]) ).
fof(f348,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1216,plain,
( ssItem(sK41(sK53))
| nil = sK54
| ~ ssList(nil)
| ~ ssList(sK54) ),
inference(resolution,[],[f760,f1013]) ).
fof(f1013,plain,
( ~ neq(sK54,nil)
| ssItem(sK41(sK53)) ),
inference(subsumption_resolution,[],[f1012,f656]) ).
fof(f1012,plain,
( ~ ssList(sK53)
| ssItem(sK41(sK53))
| ~ neq(sK54,nil) ),
inference(resolution,[],[f776,f752]) ).
fof(f752,plain,
( singletonP(sK53)
| ~ neq(sK54,nil) ),
inference(literal_reordering,[],[f555]) ).
fof(f555,plain,
( singletonP(sK53)
| ~ neq(sK54,nil) ),
inference(definition_unfolding,[],[f547,f548,f546]) ).
fof(f548,plain,
sK56 = sK54,
inference(cnf_transformation,[],[f344]) ).
fof(f547,plain,
( ~ neq(sK56,nil)
| singletonP(sK55) ),
inference(cnf_transformation,[],[f344]) ).
fof(f776,plain,
! [X0] :
( ~ singletonP(X0)
| ssItem(sK41(X0))
| ~ ssList(X0) ),
inference(literal_reordering,[],[f502]) ).
fof(f502,plain,
! [X0] :
( ~ singletonP(X0)
| ssItem(sK41(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f317,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK41(X0),nil) = X0
& ssItem(sK41(X0)) )
| ~ singletonP(X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41])],[f315,f316]) ).
fof(f316,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK41(X0),nil) = X0
& ssItem(sK41(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f315,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) ) ),
inference(rectify,[],[f314]) ).
fof(f314,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) ) ),
inference(nnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( ~ ssList(X0)
| ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f760,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(literal_reordering,[],[f533]) ).
fof(f533,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f335]) ).
fof(f335,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1450,plain,
( nil = sK54
| ~ ssItem(sK41(sK53)) ),
inference(subsumption_resolution,[],[f1428,f775]) ).
fof(f1428,plain,
( nil = sK54
| ~ ssItem(sK41(sK53))
| strictorderedP(sK53) ),
inference(superposition,[],[f621,f1220]) ).
fof(f1220,plain,
( sK53 = cons(sK41(sK53),nil)
| nil = sK54 ),
inference(subsumption_resolution,[],[f1219,f753]) ).
fof(f1219,plain,
( nil = sK54
| ~ ssList(nil)
| sK53 = cons(sK41(sK53),nil) ),
inference(subsumption_resolution,[],[f1215,f725]) ).
fof(f1215,plain,
( ~ ssList(sK54)
| ~ ssList(nil)
| nil = sK54
| sK53 = cons(sK41(sK53),nil) ),
inference(resolution,[],[f760,f1144]) ).
fof(f1144,plain,
( ~ neq(sK54,nil)
| sK53 = cons(sK41(sK53),nil) ),
inference(subsumption_resolution,[],[f1143,f656]) ).
fof(f1143,plain,
( sK53 = cons(sK41(sK53),nil)
| ~ ssList(sK53)
| ~ neq(sK54,nil) ),
inference(resolution,[],[f609,f752]) ).
fof(f609,plain,
! [X0] :
( ~ singletonP(X0)
| ~ ssList(X0)
| cons(sK41(X0),nil) = X0 ),
inference(literal_reordering,[],[f503]) ).
fof(f503,plain,
! [X0] :
( ~ singletonP(X0)
| ~ ssList(X0)
| cons(sK41(X0),nil) = X0 ),
inference(cnf_transformation,[],[f317]) ).
fof(f621,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(literal_reordering,[],[f414]) ).
fof(f414,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f630,plain,
segmentP(sK54,sK53),
inference(literal_reordering,[],[f557]) ).
fof(f557,plain,
segmentP(sK54,sK53),
inference(definition_unfolding,[],[f543,f548,f546]) ).
fof(f543,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f344]) ).
fof(f775,plain,
~ strictorderedP(sK53),
inference(literal_reordering,[],[f544]) ).
fof(f544,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f344]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC294+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 : 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 18:54:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (26023)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.19/0.52 % (26044)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.52 % (26036)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.52 % (26028)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.36/0.53 % (26024)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.36/0.53 % (26027)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.36/0.53 % (26040)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.36/0.53 % (26025)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.36/0.53 % (26050)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.36/0.53 % (26022)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.36/0.53 % (26026)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.36/0.53 % (26046)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.36/0.53 % (26047)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.36/0.53 % (26029)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.36/0.54 % (26051)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)
% 1.36/0.54 % (26029)Instruction limit reached!
% 1.36/0.54 % (26029)------------------------------
% 1.36/0.54 % (26029)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (26029)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (26029)Termination reason: Unknown
% 1.36/0.54 % (26029)Termination phase: Property scanning
% 1.36/0.54
% 1.36/0.54 % (26029)Memory used [KB]: 1279
% 1.36/0.54 % (26029)Time elapsed: 0.005 s
% 1.36/0.54 % (26029)Instructions burned: 9 (million)
% 1.36/0.54 % (26029)------------------------------
% 1.36/0.54 % (26029)------------------------------
% 1.36/0.54 % (26038)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.36/0.54 % (26048)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.36/0.54 % (26039)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.36/0.54 % (26032)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.36/0.54 % (26042)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.36/0.54 % (26043)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.51/0.54 % (26045)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)
% 1.51/0.54 % (26033)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)
% 1.51/0.54 % (26031)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.51/0.54 % (26034)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.51/0.55 % (26035)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.51/0.55 % (26030)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.51/0.55 % (26030)Instruction limit reached!
% 1.51/0.55 % (26030)------------------------------
% 1.51/0.55 % (26030)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.55 % (26030)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.55 % (26030)Termination reason: Unknown
% 1.51/0.55 % (26030)Termination phase: Preprocessing 2
% 1.51/0.55
% 1.51/0.55 % (26030)Memory used [KB]: 1023
% 1.51/0.55 % (26030)Time elapsed: 0.002 s
% 1.51/0.55 % (26030)Instructions burned: 2 (million)
% 1.51/0.55 % (26030)------------------------------
% 1.51/0.55 % (26030)------------------------------
% 1.51/0.55 % (26023)Refutation not found, incomplete strategy% (26023)------------------------------
% 1.51/0.55 % (26023)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.55 % (26023)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.55 % (26023)Termination reason: Refutation not found, incomplete strategy
% 1.51/0.55
% 1.51/0.55 % (26023)Memory used [KB]: 6012
% 1.51/0.55 % (26023)Time elapsed: 0.130 s
% 1.51/0.55 % (26023)Instructions burned: 18 (million)
% 1.51/0.55 % (26023)------------------------------
% 1.51/0.55 % (26023)------------------------------
% 1.51/0.55 % (26037)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.51/0.56 % (26036)First to succeed.
% 1.51/0.56 % (26049)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.51/0.56 % (26041)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.51/0.57 TRYING [1]
% 1.51/0.58 % (26036)Refutation found. Thanks to Tanya!
% 1.51/0.58 % SZS status Theorem for theBenchmark
% 1.51/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.51/0.58 % (26036)------------------------------
% 1.51/0.58 % (26036)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.58 % (26036)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.58 % (26036)Termination reason: Refutation
% 1.51/0.58
% 1.51/0.58 % (26036)Memory used [KB]: 6780
% 1.51/0.58 % (26036)Time elapsed: 0.039 s
% 1.51/0.58 % (26036)Instructions burned: 42 (million)
% 1.51/0.58 % (26036)------------------------------
% 1.51/0.58 % (26036)------------------------------
% 1.51/0.58 % (26021)Success in time 0.222 s
%------------------------------------------------------------------------------