%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL518+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:52:50 AM UTC 2026
% Result : Theorem 5.65s 1.75s
% Output : Refutation 7.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 32
% Syntax : Number of formulae : 131 ( 44 unt; 16 def)
% Number of atoms : 293 ( 17 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 297 ( 135 ~; 129 |; 2 &)
% ( 21 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 27 ( 25 usr; 25 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 103 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn3) ).
fof(f22,axiom,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
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(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(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f43,conjecture,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
fof(f44,negated_conjecture,
~ r1,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r1,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
=> r1 ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f51,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r1
| ? [X0] : ~ is_a_theorem(implies(or(X0,X0),X0)) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
( r1
| ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f58]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f53]) ).
fof(f67,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f69,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f57]) ).
fof(f70,plain,
( r1
| ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
inference(cnf_transformation,[],[f64]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f59]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f61]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f79,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f82,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f87,plain,
~ r1,
inference(cnf_transformation,[],[f45]) ).
fof(f97,definition,
( spl1_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f101,definition,
( spl1_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f102,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f103,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f74,f101,f97]) ).
fof(f105,definition,
( spl1_5
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f109,definition,
( spl1_6
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f110,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f111,plain,
( ~ spl1_5
| spl1_6 ),
inference(avatar_split_clause,[],[f73,f109,f105]) ).
fof(f121,definition,
( spl1_9
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).
fof(f125,definition,
( spl1_10
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f126,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f127,plain,
( ~ spl1_9
| spl1_10 ),
inference(avatar_split_clause,[],[f71,f125,f121]) ).
fof(f129,definition,
( spl1_11
<=> is_a_theorem(implies(or(sK0,sK0),sK0)) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f131,plain,
( ~ is_a_theorem(implies(or(sK0,sK0),sK0))
| spl1_11 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f133,definition,
( spl1_12
<=> r1 ),
introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition]) ).
fof(f136,plain,
( ~ spl1_11
| spl1_12 ),
inference(avatar_split_clause,[],[f70,f133,f129]) ).
fof(f138,definition,
( spl1_13
<=> kn3 ),
introduced(definition,[new_symbols(definition,[spl1_13])],[avatar_definition]) ).
fof(f142,definition,
( spl1_14
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
introduced(definition,[new_symbols(definition,[spl1_14])],[avatar_definition]) ).
fof(f143,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ spl1_14 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f144,plain,
( ~ spl1_13
| spl1_14 ),
inference(avatar_split_clause,[],[f69,f142,f138]) ).
fof(f146,definition,
( spl1_15
<=> kn2 ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f150,definition,
( spl1_16
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f151,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f152,plain,
( ~ spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f68,f150,f146]) ).
fof(f154,definition,
( spl1_17
<=> kn1 ),
introduced(definition,[new_symbols(definition,[spl1_17])],[avatar_definition]) ).
fof(f158,definition,
( spl1_18
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[spl1_18])],[avatar_definition]) ).
fof(f159,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl1_18 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f160,plain,
( ~ spl1_17
| spl1_18 ),
inference(avatar_split_clause,[],[f67,f158,f154]) ).
fof(f170,definition,
( spl1_21
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_21])],[avatar_definition]) ).
fof(f174,definition,
( spl1_22
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_22])],[avatar_definition]) ).
fof(f175,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl1_22 ),
inference(avatar_component_clause,[],[f174]) ).
fof(f176,plain,
( ~ spl1_21
| spl1_22 ),
inference(avatar_split_clause,[],[f65,f174,f170]) ).
fof(f177,plain,
~ spl1_12,
inference(avatar_split_clause,[],[f87,f133]) ).
fof(f178,plain,
spl1_9,
inference(avatar_split_clause,[],[f76,f121]) ).
fof(f179,plain,
spl1_5,
inference(avatar_split_clause,[],[f77,f105]) ).
fof(f181,plain,
spl1_21,
inference(avatar_split_clause,[],[f79,f170]) ).
fof(f182,plain,
spl1_17,
inference(avatar_split_clause,[],[f80,f154]) ).
fof(f183,plain,
spl1_15,
inference(avatar_split_clause,[],[f81,f146]) ).
fof(f184,plain,
spl1_13,
inference(avatar_split_clause,[],[f82,f138]) ).
fof(f186,plain,
spl1_3,
inference(avatar_split_clause,[],[f84,f97]) ).
fof(f189,plain,
( ! [X0] : ~ is_a_theorem(implies(implies(X0,and(X0,X0)),implies(or(sK0,sK0),sK0)))
| spl1_11
| ~ spl1_18
| ~ spl1_22 ),
inference(unit_resulting_resolution,[],[f175,f131,f159]) ).
fof(f208,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl1_6
| ~ spl1_10 ),
inference(superposition,[],[f126,f110]) ).
fof(f212,plain,
( ! [X2,X0,X1] : implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1)))
| ~ spl1_6
| ~ spl1_10 ),
inference(superposition,[],[f110,f126]) ).
fof(f222,plain,
( ! [X0,X1] : is_a_theorem(implies(not(and(and(X0,X0),X1)),not(and(X1,X0))))
| ~ spl1_14
| ~ spl1_18
| ~ spl1_22 ),
inference(unit_resulting_resolution,[],[f175,f159,f143]) ).
fof(f232,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X0)),implies(X0,X1))))
| ~ spl1_6
| ~ spl1_14 ),
inference(superposition,[],[f143,f110]) ).
fof(f343,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(and(X0,X0),X1),not(and(not(X1),X0))))
| ~ spl1_6
| ~ spl1_14
| ~ spl1_18
| ~ spl1_22 ),
inference(superposition,[],[f222,f110]) ).
fof(f621,plain,
( ! [X0] : ~ is_a_theorem(implies(not(and(not(X0),or(X0,X0))),implies(or(sK0,sK0),sK0)))
| ~ spl1_6
| ~ spl1_10
| spl1_11
| ~ spl1_18
| ~ spl1_22 ),
inference(superposition,[],[f189,f212]) ).
fof(f703,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X0,X1),implies(not(and(X1,X2)),implies(X2,X0))))
| ~ spl1_6
| ~ spl1_10
| ~ spl1_14 ),
inference(superposition,[],[f232,f208]) ).
fof(f2029,plain,
( ! [X0] : is_a_theorem(not(and(not(X0),X0)))
| ~ spl1_6
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(unit_resulting_resolution,[],[f175,f151,f343]) ).
fof(f2113,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl1_6
| ~ spl1_10
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(superposition,[],[f2029,f126]) ).
fof(f2183,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl1_4
| ~ spl1_6
| ~ spl1_10
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(superposition,[],[f2113,f102]) ).
fof(f2442,plain,
( ! [X0] : is_a_theorem(or(X0,not(X0)))
| ~ spl1_4
| ~ spl1_6
| ~ spl1_10
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(superposition,[],[f2183,f208]) ).
fof(f5928,plain,
( ~ is_a_theorem(or(sK0,not(sK0)))
| ~ spl1_6
| ~ spl1_10
| spl1_11
| ~ spl1_14
| ~ spl1_18
| ~ spl1_22 ),
inference(unit_resulting_resolution,[],[f175,f703,f621]) ).
fof(f5962,plain,
( $false
| ~ spl1_4
| ~ spl1_6
| ~ spl1_10
| spl1_11
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(forward_subsumption_resolution,[],[f5928,f2442]) ).
fof(f5963,plain,
( ~ spl1_4
| ~ spl1_6
| ~ spl1_10
| spl1_11
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(avatar_contradiction_clause,[],[f5962]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f103]) ).
cnf(s3,plain,
( ~ spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f111]) ).
cnf(s5,plain,
( ~ spl1_9
| spl1_10 ),
inference(sat_conversion,[],[f127]) ).
cnf(s6,plain,
( ~ spl1_11
| spl1_12 ),
inference(sat_conversion,[],[f136]) ).
cnf(s7,plain,
( ~ spl1_13
| spl1_14 ),
inference(sat_conversion,[],[f144]) ).
cnf(s8,plain,
( ~ spl1_15
| spl1_16 ),
inference(sat_conversion,[],[f152]) ).
cnf(s9,plain,
( ~ spl1_17
| spl1_18 ),
inference(sat_conversion,[],[f160]) ).
cnf(s11,plain,
( ~ spl1_21
| spl1_22 ),
inference(sat_conversion,[],[f176]) ).
cnf(s12,plain,
~ spl1_12,
inference(sat_conversion,[],[f177]) ).
cnf(s13,plain,
spl1_9,
inference(sat_conversion,[],[f178]) ).
cnf(s14,plain,
spl1_5,
inference(sat_conversion,[],[f179]) ).
cnf(s16,plain,
spl1_21,
inference(sat_conversion,[],[f181]) ).
cnf(s17,plain,
spl1_17,
inference(sat_conversion,[],[f182]) ).
cnf(s18,plain,
spl1_15,
inference(sat_conversion,[],[f183]) ).
cnf(s19,plain,
spl1_13,
inference(sat_conversion,[],[f184]) ).
cnf(s21,plain,
spl1_3,
inference(sat_conversion,[],[f186]) ).
cnf(s27,plain,
( ~ spl1_4
| ~ spl1_6
| ~ spl1_10
| spl1_11
| ~ spl1_14
| ~ spl1_16
| ~ spl1_18
| ~ spl1_22 ),
inference(sat_conversion,[],[f5963]) ).
cnf(s28,plain,
spl1_22,
inference(rat,[],[s11,s16]) ).
cnf(s30,plain,
spl1_18,
inference(rat,[],[s9,s17]) ).
cnf(s31,plain,
spl1_16,
inference(rat,[],[s8,s18]) ).
cnf(s32,plain,
spl1_14,
inference(rat,[],[s7,s19]) ).
cnf(s33,plain,
~ spl1_11,
inference(rat,[],[s6,s12]) ).
cnf(s34,plain,
spl1_10,
inference(rat,[],[s5,s13]) ).
cnf(s36,plain,
spl1_6,
inference(rat,[],[s3,s14]) ).
cnf(s37,plain,
~ spl1_4,
inference(rat,[],[s27,s28,s30,s31,s32,s33,s34,s36]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s2,s37,s21]) ).
fof(f5964,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL518+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 15:55:34 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.65/1.75 % (3234137)Detected formulas, will run a generic FOF schedule.
% 5.65/1.75 % (3234144)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3070078217:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.65/1.75 % (3234147)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2172962350:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.65/1.75 % (3234146)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2937243599:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.65/1.75 % (3234148)dis-21_1_sil=8000:lcm=predicate:random_seed=3244087884:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 5.65/1.75 % (3234145)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=231787965:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.65/1.75 % (3234142)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3738147022:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.65/1.75 % (3234143)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=70981506:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.65/1.75 % (3234146)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234146)------------------------------
% 5.65/1.75 % (3234146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234146)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234146)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234146)Time elapsed: 0.001 s
% 5.65/1.75 % (3234146)Peak memory usage: 86 MB
% 5.65/1.75 % (3234145)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234145)------------------------------
% 5.65/1.75 % (3234145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234145)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234145)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234145)Time elapsed: 0.001 s
% 5.65/1.75 % (3234145)Peak memory usage: 86 MB
% 5.65/1.75 % (3234148)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234148)------------------------------
% 5.65/1.75 % (3234148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234148)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234148)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234148)Time elapsed: 0.002 s
% 5.65/1.75 % (3234148)Peak memory usage: 88 MB
% 5.65/1.75 % (3234148)Instructions burned: 1 (million)
% 5.65/1.75 % (3234147)Instruction limit reached!
% 5.65/1.75 % (3234147)------------------------------
% 5.65/1.75 % (3234147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234147)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234147)Termination reason: Instruction limit
% 5.65/1.75 % (3234147)Termination phase: Saturation
% 5.65/1.75 % (3234147)Time elapsed: 0.094 s
% 5.65/1.75 % (3234147)Peak memory usage: 90 MB
% 5.65/1.75 % (3234147)Instructions burned: 139 (million)
% 5.65/1.75 % (3234156)lrs+10_1_sil=8000:sp=occurrence:random_seed=4216966394:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.65/1.75 % (3234156)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234156)------------------------------
% 5.65/1.75 % (3234156)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234156)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234156)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234156)Time elapsed: 0.001 s
% 5.65/1.75 % (3234156)Peak memory usage: 87 MB
% 5.65/1.75 % (3234146)------------------------------
% 5.65/1.75 % (3234146)------------------------------
% 5.65/1.75 % (3234148)------------------------------
% 5.65/1.75 % (3234148)------------------------------
% 5.65/1.75 % (3234145)------------------------------
% 5.65/1.75 % (3234145)------------------------------
% 5.65/1.75 % (3234144)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234144)------------------------------
% 5.65/1.75 % (3234144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234144)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234144)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234144)Time elapsed: 0.312 s
% 5.65/1.75 % (3234144)Peak memory usage: 127 MB
% 5.65/1.75 % (3234144)Instructions burned: 830 (million)
% 5.65/1.75 % (3234159)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4095578393:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.65/1.75 % (3234160)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3761732567:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 5.65/1.75 % (3234159)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234159)------------------------------
% 5.65/1.75 % (3234159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234159)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234159)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234159)Time elapsed: 0.001 s
% 5.65/1.75 % (3234159)Peak memory usage: 87 MB
% 5.65/1.75 % (3234158)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1301364445:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 5.65/1.75 % (3234158)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234158)------------------------------
% 5.65/1.75 % (3234158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234158)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234158)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234158)Time elapsed: 0.001 s
% 5.65/1.75 % (3234158)Peak memory usage: 87 MB
% 5.65/1.75 % (3234144)------------------------------
% 5.65/1.75 % (3234144)------------------------------
% 5.65/1.75 % (3234156)------------------------------
% 5.65/1.75 % (3234156)------------------------------
% 5.65/1.75 % (3234160)First to succeed.
% 5.65/1.75 % (3234160)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3234137"
% 5.65/1.75 % (3234164)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2646855422:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 5.65/1.75 % (3234164)Refutation not found, incomplete strategy
% 5.65/1.75 % (3234164)------------------------------
% 5.65/1.75 % (3234164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.65/1.75 % (3234164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.75 % (3234164)CaDiCaL version: 2.1.3
% 5.65/1.75 % (3234164)Termination reason: Refutation not found, incomplete strategy
% 5.65/1.75 % (3234164)Time elapsed: 0.0000 s
% 5.65/1.75 % (3234164)Peak memory usage: 86 MB
% 5.65/1.75 % (3234159)------------------------------
% 5.65/1.75 % (3234159)------------------------------
% 5.65/1.75 % (3234165)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2793433300:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 5.65/1.75 % (3234158)------------------------------
% 5.65/1.75 % (3234158)------------------------------
% 5.65/1.75 % (3234164)------------------------------
% 5.65/1.75 % (3234164)------------------------------
% 5.65/1.75 % (3234142)Also succeeded, but the first one will report.
% 5.65/1.75 % (3234160)Refutation found. Thanks to Tanya!
% 5.65/1.75 % SZS status Theorem for theBenchmark
% 5.65/1.75 % SZS output start Proof for theBenchmark
% See solution above
% 7.04/1.94 % (3234160)------------------------------
% 7.04/1.94 % (3234160)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.04/1.94 % (3234160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.04/1.94 % (3234160)CaDiCaL version: 2.1.3
% 7.04/1.94 % (3234160)Termination reason: Refutation
% 7.04/1.94 % (3234160)Time elapsed: 0.136 s
% 7.04/1.94 % (3234160)Peak memory usage: 94 MB
% 7.04/1.94 % (3234160)Instructions burned: 206 (million)
% 7.04/1.94 % (3234160)------------------------------
% 7.04/1.94 % (3234160)------------------------------
% 7.04/1.94 % (3234137)Success in time 0.915 s
% 7.04/1.94 % Vampire exiting
%------------------------------------------------------------------------------