TSTP Solution File: SWC060+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC060+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.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 10 unt; 0 def)
% Number of atoms : 326 ( 121 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 411 ( 145 ~; 142 |; 109 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 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 : 54 ( 32 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f701,plain,
$false,
inference(subsumption_resolution,[],[f700,f519]) ).
fof(f519,plain,
ssList(sK43),
inference(cnf_transformation,[],[f324]) ).
fof(f324,plain,
( ssList(sK41)
& ssList(sK44)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(sK44,sK43)
& neq(sK43,nil) )
| ( nil = sK44
& nil = sK43 ) )
& sK44 = sK42
& sK41 = sK43
& ssList(sK43)
& ssList(sK42) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42,sK43,sK44])],[f137,f323,f322,f321,f320]) ).
fof(f320,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) ) )
| ( nil != X0
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK41)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X1 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f321,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X1 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK42 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f322,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& sK42 = X3
& sK41 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(X3,sK43)
& neq(sK43,nil) )
| ( nil = X3
& nil = sK43 ) )
& sK42 = X3
& sK41 = sK43 )
& ssList(sK43) ) ),
introduced(choice_axiom,[]) ).
fof(f323,plain,
( ? [X3] :
( ssList(X3)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(X3,sK43)
& neq(sK43,nil) )
| ( nil = X3
& nil = sK43 ) )
& sK42 = X3
& sK41 = sK43 )
=> ( ssList(sK44)
& ( ( neq(sK42,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil) ) )
| ( nil != sK41
& nil = sK42 ) )
& ( ( segmentP(sK44,sK43)
& neq(sK43,nil) )
| ( nil = sK44
& nil = sK43 ) )
& sK44 = sK42
& sK41 = sK43 ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil) ) )
| ( nil != X0
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X3
& nil = X2 ) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& neq(X4,nil)
& segmentP(X0,X4)
& ssList(X4) ) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( ~ neq(X1,nil)
| ? [X4] :
( segmentP(X1,X4)
& neq(X4,nil)
& segmentP(X0,X4)
& ssList(X4) ) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f700,plain,
~ ssList(sK43),
inference(subsumption_resolution,[],[f697,f645]) ).
fof(f645,plain,
nil != sK43,
inference(subsumption_resolution,[],[f644,f367]) ).
fof(f367,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f644,plain,
( ~ ssList(nil)
| nil != sK43 ),
inference(resolution,[],[f642,f383]) ).
fof(f383,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f642,plain,
( ~ segmentP(nil,nil)
| nil != sK43 ),
inference(subsumption_resolution,[],[f641,f519]) ).
fof(f641,plain,
( nil != sK43
| ~ ssList(sK43)
| ~ segmentP(nil,nil) ),
inference(resolution,[],[f449,f636]) ).
fof(f636,plain,
( ~ segmentP(sK43,nil)
| ~ segmentP(nil,nil)
| nil != sK43 ),
inference(forward_demodulation,[],[f634,f626]) ).
fof(f626,plain,
nil = sK42,
inference(subsumption_resolution,[],[f623,f519]) ).
fof(f623,plain,
( nil = sK42
| ~ ssList(sK43) ),
inference(resolution,[],[f383,f619]) ).
fof(f619,plain,
( ~ segmentP(sK43,sK43)
| nil = sK42 ),
inference(subsumption_resolution,[],[f618,f609]) ).
fof(f609,plain,
( ~ segmentP(sK43,sK43)
| nil = sK42
| nil != sK43 ),
inference(subsumption_resolution,[],[f608,f565]) ).
fof(f565,plain,
( segmentP(sK42,sK43)
| nil = sK42 ),
inference(definition_unfolding,[],[f525,f521,f521]) ).
fof(f521,plain,
sK44 = sK42,
inference(cnf_transformation,[],[f324]) ).
fof(f525,plain,
( segmentP(sK44,sK43)
| nil = sK44 ),
inference(cnf_transformation,[],[f324]) ).
fof(f608,plain,
( ~ segmentP(sK42,sK43)
| nil != sK43
| nil = sK42
| ~ segmentP(sK43,sK43) ),
inference(subsumption_resolution,[],[f602,f519]) ).
fof(f602,plain,
( nil = sK42
| nil != sK43
| ~ segmentP(sK43,sK43)
| ~ ssList(sK43)
| ~ segmentP(sK42,sK43) ),
inference(resolution,[],[f563,f567]) ).
fof(f567,plain,
( neq(sK43,nil)
| nil = sK42 ),
inference(definition_unfolding,[],[f523,f521]) ).
fof(f523,plain,
( neq(sK43,nil)
| nil = sK44 ),
inference(cnf_transformation,[],[f324]) ).
fof(f563,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK42,X4)
| ~ segmentP(sK43,X4)
| ~ ssList(X4)
| nil != sK43 ),
inference(definition_unfolding,[],[f527,f520,f520]) ).
fof(f520,plain,
sK41 = sK43,
inference(cnf_transformation,[],[f324]) ).
fof(f527,plain,
! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil)
| nil != sK41 ),
inference(cnf_transformation,[],[f324]) ).
fof(f618,plain,
( nil = sK43
| ~ segmentP(sK43,sK43)
| nil = sK42 ),
inference(subsumption_resolution,[],[f617,f565]) ).
fof(f617,plain,
( nil = sK43
| ~ segmentP(sK42,sK43)
| nil = sK42
| ~ segmentP(sK43,sK43) ),
inference(subsumption_resolution,[],[f612,f519]) ).
fof(f612,plain,
( ~ segmentP(sK43,sK43)
| ~ ssList(sK43)
| nil = sK42
| ~ segmentP(sK42,sK43)
| nil = sK43 ),
inference(resolution,[],[f564,f522]) ).
fof(f522,plain,
( neq(sK43,nil)
| nil = sK43 ),
inference(cnf_transformation,[],[f324]) ).
fof(f564,plain,
! [X4] :
( ~ neq(X4,nil)
| nil = sK42
| ~ ssList(X4)
| ~ segmentP(sK42,X4)
| ~ segmentP(sK43,X4) ),
inference(definition_unfolding,[],[f526,f520]) ).
fof(f526,plain,
! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK41,X4)
| ~ segmentP(sK42,X4)
| ~ neq(X4,nil)
| nil = sK42 ),
inference(cnf_transformation,[],[f324]) ).
fof(f634,plain,
( nil != sK43
| ~ segmentP(sK42,sK42)
| ~ segmentP(sK43,nil) ),
inference(backward_demodulation,[],[f610,f626]) ).
fof(f610,plain,
( ~ segmentP(sK43,sK42)
| nil != sK43
| ~ segmentP(sK42,sK42) ),
inference(subsumption_resolution,[],[f606,f518]) ).
fof(f518,plain,
ssList(sK42),
inference(cnf_transformation,[],[f324]) ).
fof(f606,plain,
( ~ segmentP(sK43,sK42)
| nil != sK43
| ~ ssList(sK42)
| ~ segmentP(sK42,sK42) ),
inference(duplicate_literal_removal,[],[f604]) ).
fof(f604,plain,
( nil != sK43
| ~ segmentP(sK43,sK42)
| nil != sK43
| ~ segmentP(sK42,sK42)
| ~ ssList(sK42) ),
inference(resolution,[],[f563,f562]) ).
fof(f562,plain,
( neq(sK42,nil)
| nil != sK43 ),
inference(definition_unfolding,[],[f529,f520]) ).
fof(f529,plain,
( neq(sK42,nil)
| nil != sK41 ),
inference(cnf_transformation,[],[f324]) ).
fof(f449,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f697,plain,
( nil = sK43
| ~ ssList(sK43) ),
inference(duplicate_literal_removal,[],[f694]) ).
fof(f694,plain,
( nil = sK43
| nil = sK43
| ~ ssList(sK43) ),
inference(resolution,[],[f474,f633]) ).
fof(f633,plain,
( segmentP(nil,sK43)
| nil = sK43 ),
inference(backward_demodulation,[],[f566,f626]) ).
fof(f566,plain,
( segmentP(sK42,sK43)
| nil = sK43 ),
inference(definition_unfolding,[],[f524,f521]) ).
fof(f524,plain,
( segmentP(sK44,sK43)
| nil = sK43 ),
inference(cnf_transformation,[],[f324]) ).
fof(f474,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f298]) ).
fof(f298,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:27:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 % (3600)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.47 % (3602)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.18/0.47 % (3597)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.48 % (3608)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.49 % (3621)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.49 % (3624)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.49 % (3601)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)
% 0.18/0.49 % (3604)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.18/0.49 % (3622)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.18/0.50 % (3609)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.50 TRYING [1]
% 0.18/0.50 % (3617)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.50 % (3618)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.18/0.50 % (3596)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)
% 0.18/0.50 % (3598)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)
% 0.18/0.50 % (3599)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)
% 0.18/0.50 % (3610)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.18/0.50 % (3619)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.50 % (3597)Refutation not found, incomplete strategy% (3597)------------------------------
% 0.18/0.50 % (3597)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (3597)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (3597)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.50
% 0.18/0.50 % (3597)Memory used [KB]: 6012
% 0.18/0.50 % (3597)Time elapsed: 0.117 s
% 0.18/0.50 % (3597)Instructions burned: 21 (million)
% 0.18/0.50 % (3597)------------------------------
% 0.18/0.50 % (3597)------------------------------
% 0.18/0.51 % (3611)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)
% 0.18/0.51 % (3605)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.51 % (3618)First to succeed.
% 0.18/0.51 % (3625)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.51 % (3603)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.52 TRYING [2]
% 0.18/0.52 % (3604)Instruction limit reached!
% 0.18/0.52 % (3604)------------------------------
% 0.18/0.52 % (3604)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (3604)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (3604)Termination reason: Unknown
% 0.18/0.52 % (3604)Termination phase: Preprocessing 3
% 0.18/0.52
% 0.18/0.52 % (3604)Memory used [KB]: 1023
% 0.18/0.52 % (3604)Time elapsed: 0.003 s
% 0.18/0.52 % (3604)Instructions burned: 3 (million)
% 0.18/0.52 % (3604)------------------------------
% 0.18/0.52 % (3604)------------------------------
% 0.18/0.52 % (3615)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)
% 0.18/0.52 % (3603)Instruction limit reached!
% 0.18/0.52 % (3603)------------------------------
% 0.18/0.52 % (3603)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (3603)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (3603)Termination reason: Unknown
% 0.18/0.52 % (3603)Termination phase: Property scanning
% 0.18/0.52
% 0.18/0.52 % (3603)Memory used [KB]: 1279
% 0.18/0.52 % (3603)Time elapsed: 0.004 s
% 0.18/0.52 % (3603)Instructions burned: 7 (million)
% 0.18/0.52 % (3603)------------------------------
% 0.18/0.52 % (3603)------------------------------
% 0.18/0.52 % (3623)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)
% 0.18/0.52 % (3613)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.18/0.52 % (3614)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.52 % (3620)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.52 % (3616)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)
% 0.18/0.52 % (3612)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)
% 0.18/0.52 % (3600)Also succeeded, but the first one will report.
% 0.18/0.53 % (3618)Refutation found. Thanks to Tanya!
% 0.18/0.53 % SZS status Theorem for theBenchmark
% 0.18/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53 % (3618)------------------------------
% 0.18/0.53 % (3618)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (3618)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (3618)Termination reason: Refutation
% 0.18/0.53
% 0.18/0.53 % (3618)Memory used [KB]: 1407
% 0.18/0.53 % (3618)Time elapsed: 0.123 s
% 0.18/0.53 % (3618)Instructions burned: 17 (million)
% 0.18/0.53 % (3618)------------------------------
% 0.18/0.53 % (3618)------------------------------
% 0.18/0.53 % (3590)Success in time 0.184 s
%------------------------------------------------------------------------------