TSTP Solution File: LCL539+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL539+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 : n005.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:40 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 103 ( 42 unt; 0 def)
% Number of atoms : 190 ( 33 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 142 ( 55 ~; 46 |; 8 &)
% ( 12 <=>; 21 =>; 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 : 126 ( 120 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f362,plain,
$false,
inference(subsumption_resolution,[],[f355,f358]) ).
fof(f358,plain,
is_a_theorem(implies(sK0,sK1)),
inference(resolution,[],[f353,f270]) ).
fof(f270,plain,
! [X0] :
( ~ is_a_theorem(necessarily(X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f269,f255]) ).
fof(f255,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(subsumption_resolution,[],[f214,f211]) ).
fof(f211,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_M) ).
fof(f214,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f165]) ).
fof(f165,plain,
( ~ axiom_M
| ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
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,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
fof(f269,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f202,f198]) ).
fof(f198,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f202,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ modus_ponens
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f168,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f167]) ).
fof(f167,plain,
( ! [X1,X0] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f144]) ).
fof(f144,plain,
( modus_ponens
=> ! [X1,X0] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f94]) ).
fof(f94,plain,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
( ! [X1,X0] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) )
<=> modus_ponens ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f353,plain,
is_a_theorem(necessarily(implies(sK0,sK1))),
inference(resolution,[],[f351,f276]) ).
fof(f276,plain,
! [X10,X9] :
( ~ is_a_theorem(and(X9,X10))
| is_a_theorem(X9) ),
inference(resolution,[],[f269,f258]) ).
fof(f258,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(subsumption_resolution,[],[f228,f239]) ).
fof(f239,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f228,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f187]) ).
fof(f187,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(rectify,[],[f170]) ).
fof(f170,plain,
( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
| ~ and_1 ),
inference(ennf_transformation,[],[f138]) ).
fof(f138,plain,
( and_1
=> ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(unused_predicate_definition_removal,[],[f100]) ).
fof(f100,plain,
( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
<=> and_1 ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
( and_1
<=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
fof(f351,plain,
is_a_theorem(and(necessarily(implies(sK0,sK1)),necessarily(implies(sK1,sK0)))),
inference(backward_demodulation,[],[f254,f319]) ).
fof(f319,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(necessarily(implies(X0,X1)),necessarily(implies(X1,X0))),
inference(forward_demodulation,[],[f318,f278]) ).
fof(f278,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(subsumption_resolution,[],[f207,f227]) ).
fof(f227,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f207,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f178]) ).
fof(f178,plain,
( ~ op_strict_implies
| ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(rectify,[],[f150]) ).
fof(f150,plain,
( ~ op_strict_implies
| ! [X1,X0] : strict_implies(X1,X0) = necessarily(implies(X1,X0)) ),
inference(ennf_transformation,[],[f108]) ).
fof(f108,plain,
( op_strict_implies
=> ! [X1,X0] : strict_implies(X1,X0) = necessarily(implies(X1,X0)) ),
inference(rectify,[],[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(f318,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),necessarily(implies(X1,X0))),
inference(forward_demodulation,[],[f317,f278]) ).
fof(f317,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(subsumption_resolution,[],[f199,f241]) ).
fof(f241,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f88]) ).
fof(f88,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f199,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f177]) ).
fof(f177,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(rectify,[],[f171]) ).
fof(f171,plain,
( ! [X1,X0] : strict_equiv(X1,X0) = and(strict_implies(X1,X0),strict_implies(X0,X1))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f95]) ).
fof(f95,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(f254,plain,
is_a_theorem(strict_equiv(sK0,sK1)),
inference(subsumption_resolution,[],[f222,f242]) ).
fof(f242,plain,
~ substitution_strict_equiv,
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
~ substitution_strict_equiv,
inference(flattening,[],[f90]) ).
fof(f90,negated_conjecture,
~ substitution_strict_equiv,
inference(negated_conjecture,[],[f89]) ).
fof(f89,conjecture,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f222,plain,
( is_a_theorem(strict_equiv(sK0,sK1))
| substitution_strict_equiv ),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
( substitution_strict_equiv
| ( is_a_theorem(strict_equiv(sK0,sK1))
& sK0 != sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f182,f183]) ).
fof(f183,plain,
( ? [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
& X0 != X1 )
=> ( is_a_theorem(strict_equiv(sK0,sK1))
& sK0 != sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
( substitution_strict_equiv
| ? [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
& X0 != X1 ) ),
inference(rectify,[],[f174]) ).
fof(f174,plain,
( substitution_strict_equiv
| ? [X1,X0] :
( is_a_theorem(strict_equiv(X1,X0))
& X0 != X1 ) ),
inference(ennf_transformation,[],[f128]) ).
fof(f128,plain,
( ! [X1,X0] :
( is_a_theorem(strict_equiv(X1,X0))
=> X0 = X1 )
=> substitution_strict_equiv ),
inference(unused_predicate_definition_removal,[],[f114]) ).
fof(f114,plain,
( ! [X1,X0] :
( 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(f355,plain,
~ is_a_theorem(implies(sK0,sK1)),
inference(resolution,[],[f354,f332]) ).
fof(f332,plain,
( ~ is_a_theorem(implies(sK1,sK0))
| ~ is_a_theorem(implies(sK0,sK1)) ),
inference(resolution,[],[f330,f311]) ).
fof(f311,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f284,f269]) ).
fof(f284,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f283,f269]) ).
fof(f283,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(subsumption_resolution,[],[f245,f237]) ).
fof(f237,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f245,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f192]) ).
fof(f192,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(rectify,[],[f160]) ).
fof(f160,plain,
( ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0))))
| ~ and_3 ),
inference(ennf_transformation,[],[f136]) ).
fof(f136,plain,
( and_3
=> ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(unused_predicate_definition_removal,[],[f110]) ).
fof(f110,plain,
( and_3
<=> ! [X1,X0] : is_a_theorem(implies(X1,implies(X0,and(X1,X0)))) ),
inference(rectify,[],[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(f330,plain,
~ is_a_theorem(and(implies(sK0,sK1),implies(sK1,sK0))),
inference(backward_demodulation,[],[f264,f320]) ).
fof(f320,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(subsumption_resolution,[],[f203,f197]) ).
fof(f197,plain,
op_equiv,
inference(cnf_transformation,[],[f87]) ).
fof(f87,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_equiv) ).
fof(f203,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f264,plain,
~ is_a_theorem(equiv(sK0,sK1)),
inference(extensionality_resolution,[],[f263,f253]) ).
fof(f253,plain,
sK0 != sK1,
inference(subsumption_resolution,[],[f221,f242]) ).
fof(f221,plain,
( substitution_strict_equiv
| sK0 != sK1 ),
inference(cnf_transformation,[],[f184]) ).
fof(f263,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(subsumption_resolution,[],[f200,f252]) ).
fof(f252,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(f200,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f143]) ).
fof(f143,plain,
( substitution_of_equivalents
=> ! [X1,X0] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X1,X0] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f354,plain,
is_a_theorem(implies(sK1,sK0)),
inference(resolution,[],[f352,f270]) ).
fof(f352,plain,
is_a_theorem(necessarily(implies(sK1,sK0))),
inference(resolution,[],[f351,f277]) ).
fof(f277,plain,
! [X11,X12] :
( ~ is_a_theorem(and(X11,X12))
| is_a_theorem(X12) ),
inference(resolution,[],[f269,f260]) ).
fof(f260,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)),
inference(subsumption_resolution,[],[f232,f205]) ).
fof(f205,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f232,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X1,X0),X0))
| ~ and_2 ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
( ~ and_2
| ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)) ),
inference(ennf_transformation,[],[f137]) ).
fof(f137,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f116]) ).
fof(f116,plain,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
( and_2
<=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL539+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % 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 : n005.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 : Tue Aug 30 02:07:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (21187)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.19/0.51 % (21195)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.19/0.51 % (21176)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.19/0.51 TRYING [1]
% 0.19/0.51 TRYING [2]
% 0.19/0.52 % (21177)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.19/0.52 TRYING [3]
% 0.19/0.52 % (21180)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (21204)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.53 % (21178)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.19/0.53 % (21179)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.19/0.53 % (21189)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53 % (21181)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.19/0.53 % (21185)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.19/0.53 % (21184)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.19/0.53 % (21197)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.53 % (21184)Instruction limit reached!
% 0.19/0.53 % (21184)------------------------------
% 0.19/0.53 % (21184)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (21184)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (21184)Termination reason: Unknown
% 0.19/0.53 % (21184)Termination phase: Unused predicate definition removal
% 0.19/0.53
% 0.19/0.53 % (21184)Memory used [KB]: 1023
% 0.19/0.53 % (21184)Time elapsed: 0.003 s
% 0.19/0.53 % (21184)Instructions burned: 2 (million)
% 0.19/0.53 % (21184)------------------------------
% 0.19/0.53 % (21184)------------------------------
% 0.19/0.53 % (21183)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53 % (21186)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53 % (21190)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.19/0.53 % (21183)Instruction limit reached!
% 0.19/0.53 % (21183)------------------------------
% 0.19/0.53 % (21183)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (21183)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (21183)Termination reason: Unknown
% 0.19/0.53 % (21183)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (21183)Memory used [KB]: 5756
% 0.19/0.53 % (21183)Time elapsed: 0.126 s
% 0.19/0.53 % (21183)Instructions burned: 8 (million)
% 0.19/0.53 % (21183)------------------------------
% 0.19/0.53 % (21183)------------------------------
% 0.19/0.53 % (21201)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.54 % (21196)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.19/0.54 % (21200)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.54 % (21199)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.19/0.54 % (21198)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.19/0.54 % (21202)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.19/0.54 % (21192)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.19/0.54 % (21193)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.54 % (21188)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.19/0.54 % (21198)First to succeed.
% 0.19/0.54 TRYING [1]
% 0.19/0.54 TRYING [2]
% 0.19/0.55 % (21194)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.55 % (21182)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.19/0.55 % (21205)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.19/0.55 TRYING [1]
% 0.19/0.55 % (21191)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.19/0.55 TRYING [2]
% 0.19/0.56 % (21203)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.19/0.57 % (21198)Refutation found. Thanks to Tanya!
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57 % (21198)------------------------------
% 0.19/0.57 % (21198)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (21198)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (21198)Termination reason: Refutation
% 0.19/0.57
% 0.19/0.57 % (21198)Memory used [KB]: 1151
% 0.19/0.57 % (21198)Time elapsed: 0.096 s
% 0.19/0.57 % (21198)Instructions burned: 8 (million)
% 0.19/0.57 % (21198)------------------------------
% 0.19/0.57 % (21198)------------------------------
% 0.19/0.57 % (21175)Success in time 0.22 s
%------------------------------------------------------------------------------