TSTP Solution File: LCL526+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL526+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 : 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 17:48:37 EDT 2022
% Result : Theorem 1.40s 0.57s
% Output : Refutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 101 ( 42 unt; 0 def)
% Number of atoms : 185 ( 33 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 142 ( 58 ~; 49 |; 6 &)
% ( 9 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 122 ( 118 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f353,plain,
$false,
inference(subsumption_resolution,[],[f347,f346]) ).
fof(f346,plain,
is_a_theorem(implies(sK0,sK1)),
inference(resolution,[],[f344,f268]) ).
fof(f268,plain,
! [X10] :
( ~ is_a_theorem(necessarily(X10))
| is_a_theorem(X10) ),
inference(resolution,[],[f262,f249]) ).
fof(f249,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(subsumption_resolution,[],[f197,f242]) ).
fof(f242,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_axiom_M) ).
fof(f197,plain,
! [X0] :
( ~ axiom_M
| is_a_theorem(implies(necessarily(X0),X0)) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f126]) ).
fof(f126,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,axiom,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
<=> axiom_M ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
fof(f262,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f193,f213]) ).
fof(f213,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f193,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0)
| ~ modus_ponens
| ~ is_a_theorem(X1) ),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
( ~ modus_ponens
| ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) ) ),
inference(rectify,[],[f172]) ).
fof(f172,plain,
( ~ modus_ponens
| ! [X1,X0] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
inference(flattening,[],[f171]) ).
fof(f171,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f144]) ).
fof(f144,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f344,plain,
is_a_theorem(necessarily(implies(sK0,sK1))),
inference(resolution,[],[f342,f266]) ).
fof(f266,plain,
! [X6,X7] :
( ~ is_a_theorem(and(X6,X7))
| is_a_theorem(X7) ),
inference(resolution,[],[f262,f252]) ).
fof(f252,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)),
inference(subsumption_resolution,[],[f204,f217]) ).
fof(f217,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f204,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X1,X0),X0))
| ~ and_2 ),
inference(cnf_transformation,[],[f183]) ).
fof(f183,plain,
( ~ and_2
| ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)) ),
inference(rectify,[],[f168]) ).
fof(f168,plain,
( ~ and_2
| ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(ennf_transformation,[],[f137]) ).
fof(f137,plain,
( and_2
=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f8,axiom,
( ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X1))
<=> and_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_2) ).
fof(f342,plain,
is_a_theorem(and(necessarily(implies(sK1,sK0)),necessarily(implies(sK0,sK1)))),
inference(backward_demodulation,[],[f248,f301]) ).
fof(f301,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(necessarily(implies(X0,X1)),necessarily(implies(X1,X0))),
inference(forward_demodulation,[],[f300,f275]) ).
fof(f275,plain,
! [X0,X1] : strict_implies(X1,X0) = necessarily(implies(X1,X0)),
inference(subsumption_resolution,[],[f223,f195]) ).
fof(f195,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f223,plain,
! [X0,X1] :
( strict_implies(X1,X0) = necessarily(implies(X1,X0))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f186]) ).
fof(f186,plain,
( ! [X0,X1] : strict_implies(X1,X0) = necessarily(implies(X1,X0))
| ~ op_strict_implies ),
inference(rectify,[],[f160]) ).
fof(f160,plain,
( ! [X1,X0] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X1,X0] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f300,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),necessarily(implies(X1,X0))),
inference(forward_demodulation,[],[f299,f275]) ).
fof(f299,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(subsumption_resolution,[],[f202,f196]) ).
fof(f196,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f87]) ).
fof(f87,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f202,plain,
! [X0,X1] :
( ~ op_strict_equiv
| strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
inference(cnf_transformation,[],[f181]) ).
fof(f181,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
( ! [X1,X0] : strict_equiv(X1,X0) = and(strict_implies(X1,X0),strict_implies(X0,X1))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f101]) ).
fof(f101,plain,
( op_strict_equiv
=> ! [X1,X0] : strict_equiv(X1,X0) = and(strict_implies(X1,X0),strict_implies(X0,X1)) ),
inference(rectify,[],[f76]) ).
fof(f76,axiom,
( op_strict_equiv
=> ! [X1,X0] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_equiv) ).
fof(f248,plain,
is_a_theorem(strict_equiv(sK1,sK0)),
inference(subsumption_resolution,[],[f221,f224]) ).
fof(f224,plain,
~ substitution_strict_equiv,
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
~ substitution_strict_equiv,
inference(flattening,[],[f89]) ).
fof(f89,negated_conjecture,
~ substitution_strict_equiv,
inference(negated_conjecture,[],[f88]) ).
fof(f88,conjecture,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f221,plain,
( is_a_theorem(strict_equiv(sK1,sK0))
| substitution_strict_equiv ),
inference(cnf_transformation,[],[f185]) ).
fof(f185,plain,
( ( sK1 != sK0
& is_a_theorem(strict_equiv(sK1,sK0)) )
| substitution_strict_equiv ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f149,f184]) ).
fof(f184,plain,
( ? [X0,X1] :
( X0 != X1
& is_a_theorem(strict_equiv(X1,X0)) )
=> ( sK1 != sK0
& is_a_theorem(strict_equiv(sK1,sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X0,X1] :
( X0 != X1
& is_a_theorem(strict_equiv(X1,X0)) )
| substitution_strict_equiv ),
inference(ennf_transformation,[],[f128]) ).
fof(f128,plain,
( ! [X0,X1] :
( is_a_theorem(strict_equiv(X1,X0))
=> X0 = X1 )
=> substitution_strict_equiv ),
inference(unused_predicate_definition_removal,[],[f97]) ).
fof(f97,plain,
( ! [X0,X1] :
( is_a_theorem(strict_equiv(X1,X0))
=> X0 = X1 )
<=> substitution_strict_equiv ),
inference(rectify,[],[f53]) ).
fof(f53,axiom,
( ! [X1,X0] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 )
<=> substitution_strict_equiv ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_strict_equiv) ).
fof(f347,plain,
~ is_a_theorem(implies(sK0,sK1)),
inference(resolution,[],[f345,f329]) ).
fof(f329,plain,
( ~ is_a_theorem(implies(sK1,sK0))
| ~ is_a_theorem(implies(sK0,sK1)) ),
inference(resolution,[],[f327,f281]) ).
fof(f281,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f274,f262]) ).
fof(f274,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f273,f262]) ).
fof(f273,plain,
! [X0,X1] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))),
inference(subsumption_resolution,[],[f203,f238]) ).
fof(f238,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f203,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(cnf_transformation,[],[f182]) ).
fof(f182,plain,
( ~ and_3
| ! [X0,X1] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
( ~ and_3
| ! [X1,X0] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(ennf_transformation,[],[f136]) ).
fof(f136,plain,
( and_3
=> ! [X1,X0] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f9,axiom,
( and_3
<=> ! [X1,X0] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_3) ).
fof(f327,plain,
~ is_a_theorem(and(implies(sK1,sK0),implies(sK0,sK1))),
inference(backward_demodulation,[],[f258,f312]) ).
fof(f312,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(subsumption_resolution,[],[f236,f218]) ).
fof(f218,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f236,plain,
! [X0,X1] :
( ~ op_equiv
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(cnf_transformation,[],[f190]) ).
fof(f190,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(rectify,[],[f170]) ).
fof(f170,plain,
( ! [X1,X0] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0)
| ~ op_equiv ),
inference(ennf_transformation,[],[f104]) ).
fof(f104,plain,
( op_equiv
=> ! [X1,X0] : and(implies(X1,X0),implies(X0,X1)) = equiv(X1,X0) ),
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(f258,plain,
~ is_a_theorem(equiv(sK1,sK0)),
inference(extensionality_resolution,[],[f257,f247]) ).
fof(f247,plain,
sK1 != sK0,
inference(subsumption_resolution,[],[f222,f224]) ).
fof(f222,plain,
( sK1 != sK0
| substitution_strict_equiv ),
inference(cnf_transformation,[],[f185]) ).
fof(f257,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(subsumption_resolution,[],[f215,f209]) ).
fof(f209,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f215,plain,
! [X0,X1] :
( ~ substitution_of_equivalents
| X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f143]) ).
fof(f143,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f345,plain,
is_a_theorem(implies(sK1,sK0)),
inference(resolution,[],[f343,f268]) ).
fof(f343,plain,
is_a_theorem(necessarily(implies(sK1,sK0))),
inference(resolution,[],[f342,f267]) ).
fof(f267,plain,
! [X8,X9] :
( ~ is_a_theorem(and(X8,X9))
| is_a_theorem(X8) ),
inference(resolution,[],[f262,f255]) ).
fof(f255,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)),
inference(subsumption_resolution,[],[f233,f210]) ).
fof(f210,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f233,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X1,X0),X1))
| ~ and_1 ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ~ and_1
| ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(ennf_transformation,[],[f138]) ).
fof(f138,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(unused_predicate_definition_removal,[],[f111]) ).
fof(f111,plain,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
( ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0))
<=> and_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL526+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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 : n028.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:15:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.49 % (25289)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51 % (25280)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.51 % (25277)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 % (25291)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.51 % (25299)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.52 % (25290)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.52 % (25276)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.52 % (25288)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.52 % (25283)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.31/0.52 % (25282)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)
% 1.31/0.53 % (25292)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)
% 1.31/0.53 % (25297)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.31/0.53 % (25284)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.31/0.53 % (25300)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.31/0.54 % (25283)Instruction limit reached!
% 1.31/0.54 % (25283)------------------------------
% 1.31/0.54 % (25283)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.31/0.54 % (25283)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.31/0.54 % (25283)Termination reason: Unknown
% 1.31/0.54 % (25283)Termination phase: Saturation
% 1.31/0.54
% 1.31/0.54 % (25283)Memory used [KB]: 5756
% 1.31/0.54 % (25283)Time elapsed: 0.089 s
% 1.31/0.54 % (25283)Instructions burned: 8 (million)
% 1.31/0.54 % (25283)------------------------------
% 1.31/0.54 % (25283)------------------------------
% 1.31/0.54 % (25281)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.31/0.54 % (25301)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.31/0.54 TRYING [1]
% 1.31/0.54 % (25294)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.31/0.54 % (25279)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.40/0.54 % (25278)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.40/0.54 % (25287)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)
% 1.40/0.55 TRYING [1]
% 1.40/0.55 TRYING [2]
% 1.40/0.55 TRYING [2]
% 1.40/0.55 % (25298)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)
% 1.40/0.55 TRYING [3]
% 1.40/0.55 % (25293)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.40/0.55 TRYING [3]
% 1.40/0.55 TRYING [1]
% 1.40/0.55 % (25304)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.40/0.55 % (25302)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)
% 1.40/0.55 TRYING [2]
% 1.40/0.55 % (25284)Instruction limit reached!
% 1.40/0.55 % (25284)------------------------------
% 1.40/0.55 % (25284)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.55 % (25284)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.55 % (25284)Termination reason: Unknown
% 1.40/0.55 % (25284)Termination phase: Saturation
% 1.40/0.55
% 1.40/0.55 % (25284)Memory used [KB]: 1023
% 1.40/0.55 % (25284)Time elapsed: 0.003 s
% 1.40/0.55 % (25284)Instructions burned: 3 (million)
% 1.40/0.55 % (25284)------------------------------
% 1.40/0.55 % (25284)------------------------------
% 1.40/0.56 % (25303)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)
% 1.40/0.56 % (25286)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.40/0.56 % (25298)First to succeed.
% 1.40/0.56 % (25295)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)
% 1.40/0.56 % (25305)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)
% 1.40/0.56 % (25296)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)
% 1.40/0.57 % (25285)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)
% 1.40/0.57 % (25298)Refutation found. Thanks to Tanya!
% 1.40/0.57 % SZS status Theorem for theBenchmark
% 1.40/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.40/0.58 % (25298)------------------------------
% 1.40/0.58 % (25298)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.58 % (25298)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.58 % (25298)Termination reason: Refutation
% 1.40/0.58
% 1.40/0.58 % (25298)Memory used [KB]: 1151
% 1.40/0.58 % (25298)Time elapsed: 0.153 s
% 1.40/0.58 % (25298)Instructions burned: 9 (million)
% 1.40/0.58 % (25298)------------------------------
% 1.40/0.58 % (25298)------------------------------
% 1.40/0.58 % (25272)Success in time 0.214 s
%------------------------------------------------------------------------------