TSTP Solution File: CSR018+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.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 : n007.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 15:58:32 EDT 2022
% Result : Theorem 1.43s 0.55s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 85 ( 22 unt; 0 def)
% Number of atoms : 321 ( 143 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 354 ( 118 ~; 129 |; 87 &)
% ( 18 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 127 ( 125 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1169,plain,
$false,
inference(subsumption_resolution,[],[f1087,f254]) ).
fof(f254,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0] : ~ less(X0,n0),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
~ ? [X0] : less(X0,n0),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
~ ? [X8] : less(X8,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
fof(f1087,plain,
less(n0,n0),
inference(backward_demodulation,[],[f364,f1066]) ).
fof(f1066,plain,
n0 = n1,
inference(subsumption_resolution,[],[f1037,f299]) ).
fof(f299,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f187]) ).
fof(f187,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1] :
( ( less(X1,X0)
| less(X0,X1)
| X0 = X1 )
& ( ( ~ less(X0,X1)
& X0 != X1 )
| ~ less(X1,X0) ) ),
inference(flattening,[],[f122]) ).
fof(f122,plain,
! [X0,X1] :
( ( less(X1,X0)
| less(X0,X1)
| X0 = X1 )
& ( ( ~ less(X0,X1)
& X0 != X1 )
| ~ less(X1,X0) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( less(X1,X0)
<=> ( ~ less(X0,X1)
& X0 != X1 ) ),
inference(rectify,[],[f43]) ).
fof(f43,axiom,
! [X9,X8] :
( ( ~ less(X9,X8)
& X8 != X9 )
<=> less(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f1037,plain,
( less(n1,n1)
| n0 = n1 ),
inference(superposition,[],[f352,f1019]) ).
fof(f1019,plain,
( n1 = n2
| n0 = n1 ),
inference(subsumption_resolution,[],[f1014,f195]) ).
fof(f195,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',push_not_pull) ).
fof(f1014,plain,
( n1 = n2
| push = pull
| n0 = n1 ),
inference(resolution,[],[f706,f657]) ).
fof(f657,plain,
happens(push,n1),
inference(subsumption_resolution,[],[f656,f251]) ).
fof(f251,plain,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
~ holdsAt(backwards,n2),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ holdsAt(backwards,n2),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',backwards_2) ).
fof(f656,plain,
( holdsAt(backwards,n2)
| happens(push,n1) ),
inference(resolution,[],[f646,f305]) ).
fof(f305,plain,
! [X2] :
( initiates(pull,backwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f304]) ).
fof(f304,plain,
! [X2,X1] :
( initiates(X1,backwards,X2)
| pull != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f209]) ).
fof(f209,plain,
! [X2,X0,X1] :
( initiates(X1,X0,X2)
| backwards != X0
| pull != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0,X1,X2] :
( ( initiates(X1,X0,X2)
| ( ( backwards != X0
| pull != X1
| happens(push,X2) )
& ~ sP1(X1,X0,X2)
& ~ sP0(X1,X2,X0) ) )
& ( ( backwards = X0
& pull = X1
& ~ happens(push,X2) )
| sP1(X1,X0,X2)
| sP0(X1,X2,X0)
| ~ initiates(X1,X0,X2) ) ),
inference(rectify,[],[f132]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ( initiates(X0,X2,X1)
| ( ( backwards != X2
| pull != X0
| happens(push,X1) )
& ~ sP1(X0,X2,X1)
& ~ sP0(X0,X1,X2) ) )
& ( ( backwards = X2
& pull = X0
& ~ happens(push,X1) )
| sP1(X0,X2,X1)
| sP0(X0,X1,X2)
| ~ initiates(X0,X2,X1) ) ),
inference(flattening,[],[f131]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ( initiates(X0,X2,X1)
| ( ( backwards != X2
| pull != X0
| happens(push,X1) )
& ~ sP1(X0,X2,X1)
& ~ sP0(X0,X1,X2) ) )
& ( ( backwards = X2
& pull = X0
& ~ happens(push,X1) )
| sP1(X0,X2,X1)
| sP0(X0,X1,X2)
| ~ initiates(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X2,X0,X1] :
( initiates(X0,X2,X1)
<=> ( ( backwards = X2
& pull = X0
& ~ happens(push,X1) )
| sP1(X0,X2,X1)
| sP0(X0,X1,X2) ) ),
inference(definition_folding,[],[f64,f105,f104]) ).
fof(f104,plain,
! [X0,X1,X2] :
( sP0(X0,X1,X2)
<=> ( push = X0
& ~ happens(pull,X1)
& forwards = X2 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f105,plain,
! [X0,X2,X1] :
( sP1(X0,X2,X1)
<=> ( pull = X0
& spinning = X2
& happens(push,X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f64,plain,
! [X2,X0,X1] :
( initiates(X0,X2,X1)
<=> ( ( backwards = X2
& pull = X0
& ~ happens(push,X1) )
| ( pull = X0
& spinning = X2
& happens(push,X1) )
| ( push = X0
& ~ happens(pull,X1)
& forwards = X2 ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X3,X4,X1] :
( initiates(X3,X1,X4)
<=> ( ( forwards = X1
& ~ happens(pull,X4)
& push = X3 )
| ( spinning = X1
& happens(push,X4)
& pull = X3 )
| ( ~ happens(push,X4)
& pull = X3
& backwards = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initiates_all_defn) ).
fof(f646,plain,
! [X3] :
( ~ initiates(pull,X3,n1)
| holdsAt(X3,n2) ),
inference(forward_demodulation,[],[f645,f289]) ).
fof(f289,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
n2 = plus(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f645,plain,
! [X3] :
( holdsAt(X3,plus(n1,n1))
| ~ initiates(pull,X3,n1) ),
inference(resolution,[],[f250,f384]) ).
fof(f384,plain,
happens(pull,n1),
inference(resolution,[],[f362,f325]) ).
fof(f325,plain,
sP8(pull,n1),
inference(equality_resolution,[],[f324]) ).
fof(f324,plain,
! [X1] :
( sP8(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f273]) ).
fof(f273,plain,
! [X0,X1] :
( sP8(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| pull != X0
| n1 != X1 )
& ( ( pull = X0
& n1 = X1 )
| ~ sP8(X0,X1) ) ),
inference(rectify,[],[f163]) ).
fof(f163,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| pull != X1
| n1 != X0 )
& ( ( pull = X1
& n1 = X0 )
| ~ sP8(X1,X0) ) ),
inference(flattening,[],[f162]) ).
fof(f162,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| pull != X1
| n1 != X0 )
& ( ( pull = X1
& n1 = X0 )
| ~ sP8(X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X1,X0] :
( sP8(X1,X0)
<=> ( pull = X1
& n1 = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f362,plain,
! [X2,X3] :
( ~ sP8(X2,X3)
| happens(X2,X3) ),
inference(resolution,[],[f275,f267]) ).
fof(f267,plain,
! [X0,X1] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n2 != X1 )
& ( pull != X0
| n2 != X1 )
& ( push != X0
| n0 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( push = X0
& n2 = X1 )
| ( pull = X0
& n2 = X1 )
| ( push = X0
& n0 = X1 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(rectify,[],[f160]) ).
fof(f160,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( push != X1
| n2 != X0 )
& ( pull != X1
| n2 != X0 )
& ( push != X1
| n0 != X0 )
& ~ sP8(X1,X0) ) )
& ( ( push = X1
& n2 = X0 )
| ( pull = X1
& n2 = X0 )
| ( push = X1
& n0 = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(flattening,[],[f159]) ).
fof(f159,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( push != X1
| n2 != X0 )
& ( pull != X1
| n2 != X0 )
& ( push != X1
| n0 != X0 )
& ~ sP8(X1,X0) ) )
& ( ( push = X1
& n2 = X0 )
| ( pull = X1
& n2 = X0 )
| ( push = X1
& n0 = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X1,X0] :
( sP9(X1,X0)
<=> ( ( push = X1
& n2 = X0 )
| ( pull = X1
& n2 = X0 )
| ( push = X1
& n0 = X0 )
| sP8(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f275,plain,
! [X0,X1] :
( ~ sP9(X1,X0)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f165]) ).
fof(f165,plain,
! [X0,X1] :
( ( happens(X1,X0)
| ~ sP9(X1,X0) )
& ( sP9(X1,X0)
| ~ happens(X1,X0) ) ),
inference(nnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( happens(X1,X0)
<=> sP9(X1,X0) ),
inference(definition_folding,[],[f67,f115,f114]) ).
fof(f67,plain,
! [X0,X1] :
( happens(X1,X0)
<=> ( ( push = X1
& n2 = X0 )
| ( pull = X1
& n2 = X0 )
| ( push = X1
& n0 = X0 )
| ( pull = X1
& n1 = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X4,X3] :
( happens(X3,X4)
<=> ( ( pull = X3
& n2 = X4 )
| ( pull = X3
& n1 = X4 )
| ( n2 = X4
& push = X3 )
| ( push = X3
& n0 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f250,plain,
! [X2,X0,X1] :
( ~ happens(X0,X1)
| ~ initiates(X0,X2,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1,X2] :
( ~ happens(X0,X1)
| ~ initiates(X0,X2,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f101]) ).
fof(f101,plain,
! [X1,X2,X0] :
( ~ happens(X1,X2)
| ~ initiates(X1,X0,X2)
| holdsAt(X0,plus(X2,n1)) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
! [X2,X1,X0] :
( holdsAt(X0,plus(X2,n1))
| ~ initiates(X1,X0,X2)
| ~ happens(X1,X2) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
! [X2,X1,X0] :
( ( initiates(X1,X0,X2)
& happens(X1,X2) )
=> holdsAt(X0,plus(X2,n1)) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X3,X4] :
( ( happens(X3,X4)
& initiates(X3,X1,X4) )
=> holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_holds) ).
fof(f706,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| n0 = X1
| n2 = X1
| pull = X0 ),
inference(resolution,[],[f336,f274]) ).
fof(f274,plain,
! [X0,X1] :
( sP9(X1,X0)
| ~ happens(X1,X0) ),
inference(cnf_transformation,[],[f165]) ).
fof(f336,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| pull = X0
| n2 = X1
| n0 = X1 ),
inference(subsumption_resolution,[],[f261,f272]) ).
fof(f272,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| pull = X0 ),
inference(cnf_transformation,[],[f164]) ).
fof(f261,plain,
! [X0,X1] :
( n2 = X1
| sP8(X0,X1)
| ~ sP9(X0,X1)
| pull = X0
| n0 = X1 ),
inference(cnf_transformation,[],[f161]) ).
fof(f352,plain,
less(n1,n2),
inference(resolution,[],[f248,f326]) ).
fof(f326,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f286]) ).
fof(f286,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) )
& ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) ) ),
inference(flattening,[],[f171]) ).
fof(f171,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) )
& ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1 )
<=> less_or_equal(X0,X1) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X8,X9] :
( less_or_equal(X8,X9)
<=> ( X8 = X9
| less(X8,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f248,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ( less_or_equal(X0,n1)
| ~ less(X0,n2) )
& ( less(X0,n2)
| ~ less_or_equal(X0,n1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( less_or_equal(X0,n1)
<=> less(X0,n2) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X8] :
( less_or_equal(X8,n1)
<=> less(X8,n2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f364,plain,
less(n0,n1),
inference(resolution,[],[f280,f326]) ).
fof(f280,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f168,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
inference(rectify,[],[f34]) ).
fof(f34,axiom,
! [X8] :
( less(X8,n1)
<=> less_or_equal(X8,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/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 : n007.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 : Mon Aug 29 17:24:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (12770)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.51 % (12770)Instruction limit reached!
% 0.20/0.51 % (12770)------------------------------
% 0.20/0.51 % (12770)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (12778)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.20/0.52 % (12770)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (12770)Termination reason: Unknown
% 0.20/0.52 % (12770)Termination phase: Saturation
% 0.20/0.52
% 0.20/0.52 % (12770)Memory used [KB]: 5628
% 0.20/0.52 % (12770)Time elapsed: 0.088 s
% 0.20/0.52 % (12770)Instructions burned: 7 (million)
% 0.20/0.52 % (12770)------------------------------
% 0.20/0.52 % (12770)------------------------------
% 0.20/0.52 % (12777)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.20/0.53 % (12767)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (12768)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.20/0.53 % (12766)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.20/0.53 % (12765)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.20/0.53 % (12772)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.20/0.54 % (12784)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.54 % (12782)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.20/0.54 % (12785)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.54 % (12774)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)
% 0.20/0.54 % (12773)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (12788)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54 % (12763)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.20/0.55 % (12790)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.20/0.55 % (12778)First to succeed.
% 1.43/0.55 % (12781)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.43/0.55 % (12771)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.43/0.55 % (12771)Instruction limit reached!
% 1.43/0.55 % (12771)------------------------------
% 1.43/0.55 % (12771)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.55 % (12771)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.55 % (12771)Termination reason: Unknown
% 1.43/0.55 % (12771)Termination phase: Unused predicate definition removal
% 1.43/0.55
% 1.43/0.55 % (12771)Memory used [KB]: 895
% 1.43/0.55 % (12771)Time elapsed: 0.002 s
% 1.43/0.55 % (12771)Instructions burned: 2 (million)
% 1.43/0.55 % (12771)------------------------------
% 1.43/0.55 % (12771)------------------------------
% 1.43/0.55 % (12776)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.43/0.55 % (12778)Refutation found. Thanks to Tanya!
% 1.43/0.55 % SZS status Theorem for theBenchmark
% 1.43/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.43/0.55 % (12778)------------------------------
% 1.43/0.55 % (12778)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.55 % (12778)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.55 % (12778)Termination reason: Refutation
% 1.43/0.55
% 1.43/0.55 % (12778)Memory used [KB]: 1407
% 1.43/0.55 % (12778)Time elapsed: 0.142 s
% 1.43/0.55 % (12778)Instructions burned: 31 (million)
% 1.43/0.55 % (12778)------------------------------
% 1.43/0.55 % (12778)------------------------------
% 1.43/0.55 % (12762)Success in time 0.189 s
%------------------------------------------------------------------------------