TSTP Solution File: LCL494+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.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 : n018.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 17:48:31 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of formulae : 101 ( 34 unt; 0 def)
% Number of atoms : 199 ( 28 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 168 ( 70 ~; 65 |; 3 &)
% ( 15 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 20 ( 18 usr; 18 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 126 ( 122 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f360,plain,
$false,
inference(avatar_sat_refutation,[],[f131,f139,f149,f159,f167,f177,f184,f185,f359]) ).
fof(f359,plain,
( ~ spl2_2
| ~ spl2_3
| spl2_8
| ~ spl2_9 ),
inference(avatar_contradiction_clause,[],[f356]) ).
fof(f356,plain,
( $false
| ~ spl2_2
| ~ spl2_3
| spl2_8
| ~ spl2_9 ),
inference(resolution,[],[f285,f158]) ).
fof(f158,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK1,sK0)))
| spl2_8 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f156,plain,
( spl2_8
<=> is_a_theorem(implies(equiv(sK0,sK1),implies(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f285,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
| ~ spl2_2
| ~ spl2_3
| ~ spl2_9 ),
inference(superposition,[],[f281,f148]) ).
fof(f148,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(subsumption_resolution,[],[f114,f106]) ).
fof(f106,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_equiv) ).
fof(f114,plain,
! [X0,X1] :
( ~ op_equiv
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
( ~ op_equiv
| ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
( ~ op_equiv
| ! [X1,X0] : equiv(X1,X0) = and(implies(X1,X0),implies(X0,X1)) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
( op_equiv
=> ! [X1,X0] : equiv(X1,X0) = and(implies(X1,X0),implies(X0,X1)) ),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
( op_equiv
=> ! [X1,X0] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f281,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ spl2_2
| ~ spl2_3
| ~ spl2_9 ),
inference(forward_demodulation,[],[f271,f243]) ).
fof(f243,plain,
! [X8,X6,X7] : or(implies(X6,not(X7)),X8) = implies(and(X6,X7),X8),
inference(forward_demodulation,[],[f234,f178]) ).
fof(f178,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(subsumption_resolution,[],[f105,f113]) ).
fof(f113,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f105,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f234,plain,
! [X8,X6,X7] : not(and(and(X6,X7),not(X8))) = or(implies(X6,not(X7)),X8),
inference(superposition,[],[f183,f181]) ).
fof(f181,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f180,f179]) ).
fof(f179,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f107,f97]) ).
fof(f97,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f107,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f180,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(subsumption_resolution,[],[f108,f99]) ).
fof(f99,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f108,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
fof(f183,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(subsumption_resolution,[],[f121,f116]) ).
fof(f116,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f121,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
( ! [X1,X0] : or(X1,X0) = not(and(not(X1),not(X0)))
| ~ op_or ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
( op_or
=> ! [X1,X0] : or(X1,X0) = not(and(not(X1),not(X0))) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f271,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,not(X1)),X1))
| ~ spl2_2
| ~ spl2_3
| ~ spl2_9 ),
inference(resolution,[],[f267,f190]) ).
fof(f190,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X1,X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_2
| ~ spl2_3 ),
inference(resolution,[],[f134,f130]) ).
fof(f130,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f129,plain,
( spl2_2
<=> ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f134,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1)))
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f133,plain,
( spl2_3
<=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f267,plain,
( ! [X12,X13] : is_a_theorem(or(X12,implies(X13,not(X12))))
| ~ spl2_9 ),
inference(superposition,[],[f194,f239]) ).
fof(f239,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(superposition,[],[f178,f183]) ).
fof(f194,plain,
( ! [X6,X7] : is_a_theorem(implies(X7,implies(X6,X7)))
| ~ spl2_9 ),
inference(superposition,[],[f162,f179]) ).
fof(f162,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f161,plain,
( spl2_9
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_9])]) ).
fof(f185,plain,
spl2_10,
inference(avatar_split_clause,[],[f120,f164]) ).
fof(f164,plain,
( spl2_10
<=> r2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_10])]) ).
fof(f120,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r2) ).
fof(f184,plain,
spl2_1,
inference(avatar_split_clause,[],[f117,f125]) ).
fof(f125,plain,
( spl2_1
<=> modus_ponens ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f117,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f177,plain,
~ spl2_7,
inference(avatar_split_clause,[],[f98,f152]) ).
fof(f152,plain,
( spl2_7
<=> equivalence_2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f98,plain,
~ equivalence_2,
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
~ equivalence_2,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ equivalence_2,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
equivalence_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_2) ).
fof(f167,plain,
( spl2_9
| ~ spl2_10 ),
inference(avatar_split_clause,[],[f110,f164,f161]) ).
fof(f110,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(rectify,[],[f87]) ).
fof(f87,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,plain,
( r2
=> ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f65]) ).
fof(f65,plain,
( r2
<=> ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0))) ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
( r2
<=> ! [X4,X3] : is_a_theorem(implies(X4,or(X3,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
fof(f159,plain,
( spl2_7
| ~ spl2_8 ),
inference(avatar_split_clause,[],[f102,f156,f152]) ).
fof(f102,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK1,sK0)))
| equivalence_2 ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK1,sK0)))
| equivalence_2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f85,f90]) ).
fof(f90,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
=> ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK1,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
| equivalence_2 ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
( ! [X1,X0] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
=> equivalence_2 ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f14,axiom,
( ! [X1,X0] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
<=> equivalence_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_2) ).
fof(f149,plain,
spl2_4,
inference(avatar_split_clause,[],[f104,f136]) ).
fof(f136,plain,
( spl2_4
<=> r3 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f104,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f139,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f103,f136,f133]) ).
fof(f103,plain,
! [X0,X1] :
( ~ r3
| is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1)))
| ~ r3 ),
inference(ennf_transformation,[],[f69]) ).
fof(f69,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1)))
<=> r3 ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( ! [X4,X3] : is_a_theorem(implies(or(X3,X4),or(X4,X3)))
<=> r3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).
fof(f131,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f118,f129,f125]) ).
fof(f118,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) ) ),
inference(rectify,[],[f78]) ).
fof(f78,plain,
( ~ modus_ponens
| ! [X1,X0] :
( ~ is_a_theorem(X1)
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) ) ),
inference(flattening,[],[f77]) ).
fof(f77,plain,
( ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f74]) ).
fof(f74,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f52]) ).
fof(f52,plain,
( ! [X0,X1] :
( ( is_a_theorem(implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) )
<=> modus_ponens ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 02:08:40 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.50 % (3465)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.21/0.50 % (3457)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.52 % (3449)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52 % (3440)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (3448)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.21/0.52 % (3438)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.21/0.53 % (3436)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.21/0.53 % (3437)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.21/0.53 % (3459)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.21/0.53 % (3461)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.54 % (3455)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.21/0.54 % (3458)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.21/0.54 % (3452)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.21/0.54 % (3439)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.21/0.54 % (3462)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.21/0.54 % (3443)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (3441)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.21/0.54 % (3450)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.21/0.54 % (3449)First to succeed.
% 0.21/0.54 % (3451)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.21/0.55 % (3453)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.55 % (3449)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (3449)------------------------------
% 0.21/0.55 % (3449)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (3449)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (3449)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (3449)Memory used [KB]: 5628
% 0.21/0.55 % (3449)Time elapsed: 0.110 s
% 0.21/0.55 % (3449)Instructions burned: 8 (million)
% 0.21/0.55 % (3449)------------------------------
% 0.21/0.55 % (3449)------------------------------
% 0.21/0.55 % (3435)Success in time 0.183 s
%------------------------------------------------------------------------------