TSTP Solution File: LCL488+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL488+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 : n023.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:30 EDT 2022
% Result : Theorem 1.88s 0.62s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of formulae : 100 ( 27 unt; 0 def)
% Number of atoms : 210 ( 28 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 189 ( 79 ~; 74 |; 3 &)
% ( 17 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 21 ( 19 usr; 19 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 120 ( 116 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f455,plain,
$false,
inference(avatar_sat_refutation,[],[f134,f159,f184,f193,f201,f202,f204,f205,f207,f210,f452]) ).
fof(f452,plain,
( ~ spl2_2
| spl2_7
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17 ),
inference(avatar_contradiction_clause,[],[f445]) ).
fof(f445,plain,
( $false
| ~ spl2_2
| spl2_7
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17 ),
inference(resolution,[],[f327,f154]) ).
fof(f154,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK1))
| spl2_7 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f152,plain,
( spl2_7
<=> is_a_theorem(implies(and(sK0,sK1),sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f327,plain,
( ! [X2,X3] : is_a_theorem(implies(and(X2,X3),X3))
| ~ spl2_2
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17 ),
inference(forward_demodulation,[],[f324,f213]) ).
fof(f213,plain,
( ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1)))
| ~ spl2_15 ),
inference(forward_demodulation,[],[f188,f203]) ).
fof(f203,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f121,f102]) ).
fof(f102,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f121,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
( ~ op_implies_or
| ! [X1,X0] : implies(X1,X0) = or(not(X1),X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,plain,
( op_implies_or
=> ! [X1,X0] : implies(X1,X0) = or(not(X1),X0) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X1,X0] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f188,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ spl2_15 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f187,plain,
( spl2_15
<=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_15])]) ).
fof(f324,plain,
( ! [X2,X3] : is_a_theorem(implies(not(implies(X2,not(X3))),X3))
| ~ spl2_2
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f275,f251]) ).
fof(f251,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(not(X1),X0)) )
| ~ spl2_2
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f219,f196]) ).
fof(f196,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) )
| ~ spl2_17 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f195,plain,
( spl2_17
<=> ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_17])]) ).
fof(f219,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),X0),implies(not(X0),X1)))
| ~ spl2_2
| ~ spl2_13 ),
inference(forward_demodulation,[],[f218,f214]) ).
fof(f214,plain,
( ! [X0,X1] : or(X1,X0) = implies(not(X1),X0)
| ~ spl2_2
| ~ spl2_13 ),
inference(backward_demodulation,[],[f179,f133]) ).
fof(f133,plain,
( ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0)))
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f132,plain,
( spl2_2
<=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f179,plain,
( ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0)
| ~ spl2_13 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f178,plain,
( spl2_13
<=> ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_13])]) ).
fof(f218,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X1,X0),implies(not(X0),X1)))
| ~ spl2_2
| ~ spl2_13 ),
inference(backward_demodulation,[],[f212,f214]) ).
fof(f212,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))),
inference(subsumption_resolution,[],[f125,f116]) ).
fof(f116,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f125,plain,
! [X0,X1] :
( ~ r3
| is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
( ~ r3
| ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(ennf_transformation,[],[f74]) ).
fof(f74,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( ! [X4,X3] : is_a_theorem(implies(or(X3,X4),or(X4,X3)))
<=> r3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f275,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,implies(X0,X1)))
| ~ spl2_2
| ~ spl2_13 ),
inference(superposition,[],[f217,f230]) ).
fof(f230,plain,
( ! [X0,X1] : implies(X0,X1) = implies(not(not(X0)),X1)
| ~ spl2_2
| ~ spl2_13 ),
inference(superposition,[],[f203,f214]) ).
fof(f217,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,implies(not(X0),X1)))
| ~ spl2_2
| ~ spl2_13 ),
inference(backward_demodulation,[],[f211,f214]) ).
fof(f211,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(subsumption_resolution,[],[f118,f106]) ).
fof(f106,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f118,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(rectify,[],[f83]) ).
fof(f83,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,plain,
( r2
=> ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f51]) ).
fof(f51,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/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f210,plain,
spl2_14,
inference(avatar_split_clause,[],[f119,f181]) ).
fof(f181,plain,
( spl2_14
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_14])]) ).
fof(f119,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f207,plain,
spl2_18,
inference(avatar_split_clause,[],[f123,f198]) ).
fof(f198,plain,
( spl2_18
<=> modus_ponens ),
introduced(avatar_definition,[new_symbols(naming,[spl2_18])]) ).
fof(f123,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f205,plain,
spl2_1,
inference(avatar_split_clause,[],[f110,f128]) ).
fof(f128,plain,
( spl2_1
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f110,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f204,plain,
spl2_16,
inference(avatar_split_clause,[],[f113,f190]) ).
fof(f190,plain,
( spl2_16
<=> op_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_16])]) ).
fof(f113,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f202,plain,
~ spl2_8,
inference(avatar_split_clause,[],[f101,f156]) ).
fof(f156,plain,
( spl2_8
<=> and_2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f101,plain,
~ and_2,
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
~ and_2,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ and_2,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
and_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f201,plain,
( spl2_17
| ~ spl2_18 ),
inference(avatar_split_clause,[],[f112,f198,f195]) ).
fof(f112,plain,
! [X0,X1] :
( ~ modus_ponens
| is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ) ),
inference(flattening,[],[f92]) ).
fof(f92,plain,
( ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f59]) ).
fof(f59,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,
( ! [X1,X0] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) )
<=> modus_ponens ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f193,plain,
( spl2_15
| ~ spl2_16 ),
inference(avatar_split_clause,[],[f105,f190,f187]) ).
fof(f105,plain,
! [X0,X1] :
( ~ op_and
| and(X0,X1) = not(or(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
( ! [X1,X0] : not(or(not(X1),not(X0))) = and(X1,X0)
| ~ op_and ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,plain,
( op_and
=> ! [X1,X0] : not(or(not(X1),not(X0))) = and(X1,X0) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
( op_and
=> ! [X1,X0] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f184,plain,
( spl2_13
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f103,f181,f178]) ).
fof(f103,plain,
! [X0,X1] :
( ~ op_or
| not(and(not(X1),not(X0))) = or(X1,X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0)
| ~ op_or ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
( op_or
=> ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f159,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f107,f156,f152]) ).
fof(f107,plain,
( and_2
| ~ is_a_theorem(implies(and(sK0,sK1),sK1)) ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( and_2
| ~ is_a_theorem(implies(and(sK0,sK1),sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f87,f95]) ).
fof(f95,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X1))
=> ~ is_a_theorem(implies(and(sK0,sK1),sK1)) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
( and_2
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X1)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f77,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
=> and_2 ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_2) ).
fof(f134,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f120,f132,f128]) ).
fof(f120,plain,
! [X0,X1] :
( implies(X1,X0) = not(and(X1,not(X0)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ~ op_implies_and
| ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
( op_implies_and
=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(rectify,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X1,X0] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL488+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/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.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 02:25:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (19141)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.56 % (19157)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.56 % (19155)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.57 % (19149)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.20/0.57 % (19141)Instruction limit reached!
% 0.20/0.57 % (19141)------------------------------
% 0.20/0.57 % (19141)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (19141)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (19141)Termination reason: Unknown
% 0.20/0.57 % (19141)Termination phase: Property scanning
% 0.20/0.57
% 0.20/0.57 % (19141)Memory used [KB]: 895
% 0.20/0.57 % (19141)Time elapsed: 0.004 s
% 0.20/0.57 % (19141)Instructions burned: 2 (million)
% 0.20/0.57 % (19141)------------------------------
% 0.20/0.57 % (19141)------------------------------
% 0.20/0.57 % (19147)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.57 % (19139)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.20/0.57 TRYING [1]
% 0.20/0.57 TRYING [2]
% 0.20/0.57 TRYING [3]
% 0.20/0.58 % (19156)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.58 % (19140)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.78/0.59 % (19148)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.78/0.60 % (19138)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.78/0.60 % (19140)Instruction limit reached!
% 1.78/0.60 % (19140)------------------------------
% 1.78/0.60 % (19140)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.78/0.60 % (19157)First to succeed.
% 1.88/0.61 % (19140)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.88/0.61 % (19140)Termination reason: Unknown
% 1.88/0.61 % (19140)Termination phase: Saturation
% 1.88/0.61
% 1.88/0.61 % (19140)Memory used [KB]: 5628
% 1.88/0.61 % (19140)Time elapsed: 0.143 s
% 1.88/0.61 % (19140)Instructions burned: 7 (million)
% 1.88/0.61 % (19140)------------------------------
% 1.88/0.61 % (19140)------------------------------
% 1.88/0.61 TRYING [4]
% 1.88/0.61 % (19136)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.88/0.61 % (19135)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.88/0.62 % (19157)Refutation found. Thanks to Tanya!
% 1.88/0.62 % SZS status Theorem for theBenchmark
% 1.88/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 1.88/0.62 % (19157)------------------------------
% 1.88/0.62 % (19157)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.88/0.62 % (19157)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.88/0.62 % (19157)Termination reason: Refutation
% 1.88/0.62
% 1.88/0.62 % (19157)Memory used [KB]: 5884
% 1.88/0.62 % (19157)Time elapsed: 0.167 s
% 1.88/0.62 % (19157)Instructions burned: 15 (million)
% 1.88/0.62 % (19157)------------------------------
% 1.88/0.62 % (19157)------------------------------
% 1.88/0.62 % (19132)Success in time 0.258 s
%------------------------------------------------------------------------------