TSTP Solution File: DAT099_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT099_1 : TPTP v8.1.0. Released v6.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 : n028.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 16:04:53 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 26
% Syntax : Number of formulae : 94 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 255 ( 40 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 295 ( 125 ~; 114 |; 39 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 249 ( 81 atm; 5 fun; 119 num; 44 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 13 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 67 ( 51 !; 16 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_11,type,
sK0: $int ).
tff(func_def_12,type,
sK1: ( list * $int ) > list ).
tff(func_def_13,type,
sK2: ( list * $int ) > $int ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(f380,plain,
$false,
inference(avatar_sat_refutation,[],[f136,f189,f270,f278,f310,f320,f334,f345,f361,f373,f377]) ).
tff(f377,plain,
( ~ spl3_1
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f376]) ).
tff(f376,plain,
( $false
| ~ spl3_1
| spl3_3 ),
inference(evaluation,[],[f375]) ).
tff(f375,plain,
( ~ $less(1,4)
| ~ spl3_1
| spl3_3 ),
inference(forward_demodulation,[],[f182,f130]) ).
tff(f130,plain,
( ( 4 = sK0 )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f128]) ).
tff(f128,plain,
( spl3_1
<=> ( 4 = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
tff(f182,plain,
( ~ $less(1,sK0)
| spl3_3 ),
inference(avatar_component_clause,[],[f181]) ).
tff(f181,plain,
( spl3_3
<=> $less(1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
tff(f373,plain,
( ~ spl3_1
| ~ spl3_9 ),
inference(avatar_contradiction_clause,[],[f372]) ).
tff(f372,plain,
( $false
| ~ spl3_1
| ~ spl3_9 ),
inference(evaluation,[],[f371]) ).
tff(f371,plain,
( $less(4,2)
| ~ spl3_1
| ~ spl3_9 ),
inference(forward_demodulation,[],[f314,f130]) ).
tff(f314,plain,
( $less(sK0,2)
| ~ spl3_9 ),
inference(avatar_component_clause,[],[f312]) ).
tff(f312,plain,
( spl3_9
<=> $less(sK0,2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_9])]) ).
tff(f361,plain,
( ~ spl3_1
| ~ spl3_10 ),
inference(avatar_contradiction_clause,[],[f360]) ).
tff(f360,plain,
( $false
| ~ spl3_1
| ~ spl3_10 ),
inference(evaluation,[],[f359]) ).
tff(f359,plain,
( ( 4 = 2 )
| ~ spl3_1
| ~ spl3_10 ),
inference(backward_demodulation,[],[f318,f130]) ).
tff(f318,plain,
( ( 2 = sK0 )
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f316]) ).
tff(f316,plain,
( spl3_10
<=> ( 2 = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_10])]) ).
tff(f345,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f344]) ).
tff(f344,plain,
( $false
| ~ spl3_4 ),
inference(evaluation,[],[f339]) ).
tff(f339,plain,
( ~ $less(1,4)
| ~ spl3_4 ),
inference(backward_demodulation,[],[f37,f187]) ).
tff(f187,plain,
( ( 1 = sK0 )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f185]) ).
tff(f185,plain,
( spl3_4
<=> ( 1 = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
tff(f37,plain,
~ $less(sK0,4),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
( ~ $less(sK0,4)
& ~ inRange(sK0,cons(1,cons(3,cons(2,nil)))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f26,f27]) ).
tff(f27,plain,
( ? [X0: $int] :
( ~ $less(X0,4)
& ~ inRange(X0,cons(1,cons(3,cons(2,nil)))) )
=> ( ~ $less(sK0,4)
& ~ inRange(sK0,cons(1,cons(3,cons(2,nil)))) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
? [X0: $int] :
( ~ $less(X0,4)
& ~ inRange(X0,cons(1,cons(3,cons(2,nil)))) ),
inference(ennf_transformation,[],[f23]) ).
tff(f23,plain,
~ ! [X0: $int] :
( ~ $less(X0,4)
=> inRange(X0,cons(1,cons(3,cons(2,nil)))) ),
inference(rectify,[],[f9]) ).
tff(f9,plain,
~ ! [X2: $int] :
( ~ $less(X2,4)
=> inRange(X2,cons(1,cons(3,cons(2,nil)))) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X2: $int] :
( $greatereq(X2,4)
=> inRange(X2,cons(1,cons(3,cons(2,nil)))) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X2: $int] :
( $greatereq(X2,4)
=> inRange(X2,cons(1,cons(3,cons(2,nil)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f334,plain,
( ~ spl3_1
| spl3_5 ),
inference(avatar_contradiction_clause,[],[f333]) ).
tff(f333,plain,
( $false
| ~ spl3_1
| spl3_5 ),
inference(evaluation,[],[f329]) ).
tff(f329,plain,
( ~ $less(3,4)
| ~ spl3_1
| spl3_5 ),
inference(backward_demodulation,[],[f265,f130]) ).
tff(f265,plain,
( ~ $less(3,sK0)
| spl3_5 ),
inference(avatar_component_clause,[],[f263]) ).
tff(f263,plain,
( spl3_5
<=> $less(3,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
tff(f320,plain,
( spl3_10
| spl3_9
| spl3_6 ),
inference(avatar_split_clause,[],[f307,f267,f312,f316]) ).
tff(f267,plain,
( spl3_6
<=> inRange(sK0,cons(2,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
tff(f307,plain,
( $less(sK0,2)
| ( 2 = sK0 )
| spl3_6 ),
inference(resolution,[],[f302,f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f302,plain,
( ~ $less(2,sK0)
| spl3_6 ),
inference(subsumption_resolution,[],[f301,f48]) ).
tff(f48,plain,
! [X1: $int] : inRange(X1,nil),
inference(equality_resolution,[],[f42]) ).
tff(f42,plain,
! [X0: list,X1: $int] :
( inRange(X1,X0)
| ( nil != X0 ) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: list,X1: $int] :
( ( inRange(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| $less(X3,0)
| ~ inRange(X1,X2)
| ~ $less(X3,X1) )
& ( nil != X0 ) ) )
& ( ( ( cons(sK2(X0,X1),sK1(X0,X1)) = X0 )
& ~ $less(sK2(X0,X1),0)
& inRange(X1,sK1(X0,X1))
& $less(sK2(X0,X1),X1) )
| ( nil = X0 )
| ~ inRange(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f31,f32]) ).
tff(f32,plain,
! [X0: list,X1: $int] :
( ? [X4: list,X5: $int] :
( ( cons(X5,X4) = X0 )
& ~ $less(X5,0)
& inRange(X1,X4)
& $less(X5,X1) )
=> ( ( cons(sK2(X0,X1),sK1(X0,X1)) = X0 )
& ~ $less(sK2(X0,X1),0)
& inRange(X1,sK1(X0,X1))
& $less(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
tff(f31,plain,
! [X0: list,X1: $int] :
( ( inRange(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| $less(X3,0)
| ~ inRange(X1,X2)
| ~ $less(X3,X1) )
& ( nil != X0 ) ) )
& ( ? [X4: list,X5: $int] :
( ( cons(X5,X4) = X0 )
& ~ $less(X5,0)
& inRange(X1,X4)
& $less(X5,X1) )
| ( nil = X0 )
| ~ inRange(X1,X0) ) ),
inference(rectify,[],[f30]) ).
tff(f30,plain,
! [X0: list,X1: $int] :
( ( inRange(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| $less(X3,0)
| ~ inRange(X1,X2)
| ~ $less(X3,X1) )
& ( nil != X0 ) ) )
& ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ~ $less(X3,0)
& inRange(X1,X2)
& $less(X3,X1) )
| ( nil = X0 )
| ~ inRange(X1,X0) ) ),
inference(flattening,[],[f29]) ).
tff(f29,plain,
! [X0: list,X1: $int] :
( ( inRange(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| $less(X3,0)
| ~ inRange(X1,X2)
| ~ $less(X3,X1) )
& ( nil != X0 ) ) )
& ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ~ $less(X3,0)
& inRange(X1,X2)
& $less(X3,X1) )
| ( nil = X0 )
| ~ inRange(X1,X0) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: list,X1: $int] :
( inRange(X1,X0)
<=> ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ~ $less(X3,0)
& inRange(X1,X2)
& $less(X3,X1) )
| ( nil = X0 ) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
! [X1: list,X2: $int] :
( inRange(X2,X1)
<=> ( ? [X3: list,X0: $int] :
( inRange(X2,X3)
& $less(X0,X2)
& ( cons(X0,X3) = X1 )
& ~ $less(X0,0) )
| ( nil = X1 ) ) ),
inference(theory_normalization,[],[f5]) ).
tff(f5,axiom,
! [X1: list,X2: $int] :
( inRange(X2,X1)
<=> ( ? [X3: list,X0: $int] :
( inRange(X2,X3)
& $less(X0,X2)
& ( cons(X0,X3) = X1 )
& $lesseq(0,X0) )
| ( nil = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f301,plain,
( ~ $less(2,sK0)
| ~ inRange(sK0,nil)
| spl3_6 ),
inference(evaluation,[],[f300]) ).
tff(f300,plain,
( $less(2,0)
| ~ $less(2,sK0)
| ~ inRange(sK0,nil)
| spl3_6 ),
inference(resolution,[],[f269,f47]) ).
tff(f47,plain,
! [X2: list,X3: $int,X1: $int] :
( inRange(X1,cons(X3,X2))
| ~ $less(X3,X1)
| ~ inRange(X1,X2)
| $less(X3,0) ),
inference(equality_resolution,[],[f43]) ).
tff(f43,plain,
! [X2: list,X3: $int,X0: list,X1: $int] :
( inRange(X1,X0)
| ( cons(X3,X2) != X0 )
| $less(X3,0)
| ~ inRange(X1,X2)
| ~ $less(X3,X1) ),
inference(cnf_transformation,[],[f33]) ).
tff(f269,plain,
( ~ inRange(sK0,cons(2,nil))
| spl3_6 ),
inference(avatar_component_clause,[],[f267]) ).
tff(f310,plain,
( ~ spl3_2
| spl3_6 ),
inference(avatar_contradiction_clause,[],[f309]) ).
tff(f309,plain,
( $false
| ~ spl3_2
| spl3_6 ),
inference(evaluation,[],[f306]) ).
tff(f306,plain,
( ~ $less(2,4)
| ~ spl3_2
| spl3_6 ),
inference(resolution,[],[f302,f137]) ).
tff(f137,plain,
( ! [X0: $int] :
( $less(X0,sK0)
| ~ $less(X0,4) )
| ~ spl3_2 ),
inference(resolution,[],[f134,f16]) ).
tff(f16,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_148,[]) ).
tff(f134,plain,
( $less(4,sK0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f132]) ).
tff(f132,plain,
( spl3_2
<=> $less(4,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
tff(f278,plain,
( ~ spl3_2
| spl3_5 ),
inference(avatar_contradiction_clause,[],[f277]) ).
tff(f277,plain,
( $false
| ~ spl3_2
| spl3_5 ),
inference(evaluation,[],[f274]) ).
tff(f274,plain,
( ~ $less(3,4)
| ~ spl3_2
| spl3_5 ),
inference(resolution,[],[f265,f137]) ).
tff(f270,plain,
( ~ spl3_5
| ~ spl3_6
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f261,f181,f267,f263]) ).
tff(f261,plain,
( ~ inRange(sK0,cons(2,nil))
| ~ $less(3,sK0)
| ~ spl3_3 ),
inference(evaluation,[],[f260]) ).
tff(f260,plain,
( ~ inRange(sK0,cons(2,nil))
| $less(3,0)
| ~ $less(3,sK0)
| ~ spl3_3 ),
inference(resolution,[],[f253,f47]) ).
tff(f253,plain,
( ~ inRange(sK0,cons(3,cons(2,nil)))
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f251,f183]) ).
tff(f183,plain,
( $less(1,sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f181]) ).
tff(f251,plain,
( ~ inRange(sK0,cons(3,cons(2,nil)))
| ~ $less(1,sK0) ),
inference(evaluation,[],[f248]) ).
tff(f248,plain,
( ~ inRange(sK0,cons(3,cons(2,nil)))
| ~ $less(1,sK0)
| $less(1,0) ),
inference(resolution,[],[f47,f36]) ).
tff(f36,plain,
~ inRange(sK0,cons(1,cons(3,cons(2,nil)))),
inference(cnf_transformation,[],[f28]) ).
tff(f189,plain,
( spl3_3
| spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f178,f132,f185,f181]) ).
tff(f178,plain,
( ( 1 = sK0 )
| $less(1,sK0)
| ~ spl3_2 ),
inference(resolution,[],[f175,f17]) ).
tff(f175,plain,
( ~ $less(sK0,1)
| ~ spl3_2 ),
inference(evaluation,[],[f173]) ).
tff(f173,plain,
( ~ $less(sK0,1)
| ~ $less(0,4)
| ~ spl3_2 ),
inference(resolution,[],[f137,f77]) ).
tff(f77,plain,
! [X5: $int] :
( ~ $less(0,X5)
| ~ $less(X5,1) ),
inference(superposition,[],[f21,f59]) ).
tff(f59,plain,
! [X0: $int] : ( $sum(0,X0) = X0 ),
inference(superposition,[],[f12,f10]) ).
tff(f10,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f12,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_142,[]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_166,[]) ).
tff(f136,plain,
( spl3_2
| spl3_1 ),
inference(avatar_split_clause,[],[f118,f128,f132]) ).
tff(f118,plain,
( ( 4 = sK0 )
| $less(4,sK0) ),
inference(resolution,[],[f17,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT099=1 : TPTP v8.1.0. Released v6.1.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 : n028.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 20:30:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (14207)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.49 % (14215)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.20/0.49 % (14206)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.49 % (14224)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.50 % (14205)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.50 % (14203)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.50 % (14203)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.50 % (14203)Terminated due to inappropriate strategy.
% 0.20/0.50 % (14203)------------------------------
% 0.20/0.50 % (14203)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (14203)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (14203)Termination reason: Inappropriate
% 0.20/0.50
% 0.20/0.50 % (14203)Memory used [KB]: 895
% 0.20/0.50 % (14203)Time elapsed: 0.003 s
% 0.20/0.50 % (14203)Instructions burned: 2 (million)
% 0.20/0.50 % (14203)------------------------------
% 0.20/0.50 % (14203)------------------------------
% 0.20/0.51 % (14217)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.51 % (14226)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.51 % (14211)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.20/0.51 % (14213)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.51 % (14211)Instruction limit reached!
% 0.20/0.51 % (14211)------------------------------
% 0.20/0.51 % (14211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (14211)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (14211)Termination reason: Unknown
% 0.20/0.51 % (14211)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (14211)Memory used [KB]: 5373
% 0.20/0.51 % (14211)Time elapsed: 0.114 s
% 0.20/0.51 % (14211)Instructions burned: 3 (million)
% 0.20/0.51 % (14211)------------------------------
% 0.20/0.51 % (14211)------------------------------
% 0.20/0.51 % (14230)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.51 % (14208)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.51 % (14223)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.20/0.51 % (14204)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.20/0.51 % (14224)First to succeed.
% 0.20/0.52 % (14218)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 % (14224)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (14224)------------------------------
% 0.20/0.52 % (14224)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (14224)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (14224)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (14224)Memory used [KB]: 5628
% 0.20/0.52 % (14224)Time elapsed: 0.102 s
% 0.20/0.52 % (14224)Instructions burned: 15 (million)
% 0.20/0.52 % (14224)------------------------------
% 0.20/0.52 % (14224)------------------------------
% 0.20/0.52 % (14202)Success in time 0.165 s
%------------------------------------------------------------------------------