%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL573+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 : n009.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:53:05 AM UTC 2026
% Result : Theorem 10.81s 2.45s
% Output : Refutation 11.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 30
% Syntax : Number of formulae : 169 ( 82 unt; 2 def)
% Number of atoms : 289 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 212 ( 92 ~; 84 |; 4 &)
% ( 12 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 17 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 248 ( 0 sgn 247 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f3,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(f7,axiom,
( modus_ponens_strict_implies
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(strict_implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens_strict_implies) ).
fof(f8,axiom,
( adjunction
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(X1) )
=> is_a_theorem(and(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',adjunction) ).
fof(f9,axiom,
( substitution_strict_equiv
<=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_strict_equiv) ).
fof(f14,axiom,
( axiom_5
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f19,axiom,
( axiom_m1
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m1) ).
fof(f20,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m2) ).
fof(f21,axiom,
( axiom_m3
<=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m3) ).
fof(f22,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m4) ).
fof(f23,axiom,
( axiom_m5
<=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m5) ).
fof(f28,axiom,
( axiom_m10
<=> ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m10) ).
fof(f31,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f32,axiom,
( op_strict_equiv
=> ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_equiv) ).
fof(f36,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f38,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f39,axiom,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f40,axiom,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f41,axiom,
adjunction,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f42,axiom,
axiom_m1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f43,axiom,
axiom_m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f44,axiom,
axiom_m3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m3) ).
fof(f45,axiom,
axiom_m4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f46,axiom,
axiom_m5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m5) ).
fof(f47,axiom,
axiom_m10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).
fof(f48,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f49,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f52,conjecture,
axiom_5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_axiom_5) ).
fof(f53,negated_conjecture,
~ axiom_5,
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f54,plain,
~ axiom_5,
inference(flattening,[],[f53]) ).
fof(f55,plain,
( axiom_m10
=> ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f28]) ).
fof(f56,plain,
( axiom_m5
=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f57,plain,
( axiom_m4
=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f58,plain,
( axiom_m3
=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f59,plain,
( axiom_m2
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f60,plain,
( axiom_m1
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f61,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
=> axiom_5 ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f62,plain,
( substitution_strict_equiv
=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f63,plain,
( adjunction
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(X1) )
=> is_a_theorem(and(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f64,plain,
( modus_ponens_strict_implies
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(strict_implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f70,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f1]) ).
fof(f71,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f3]) ).
fof(f73,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1)) )
| ~ modus_ponens_strict_implies ),
inference(ennf_transformation,[],[f64]) ).
fof(f74,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1)) )
| ~ modus_ponens_strict_implies ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(ennf_transformation,[],[f63]) ).
fof(f76,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1)) )
| ~ substitution_strict_equiv ),
inference(ennf_transformation,[],[f62]) ).
fof(f78,plain,
( axiom_5
| ? [X0] : ~ is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(ennf_transformation,[],[f61]) ).
fof(f79,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(ennf_transformation,[],[f60]) ).
fof(f80,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(ennf_transformation,[],[f59]) ).
fof(f81,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(ennf_transformation,[],[f58]) ).
fof(f82,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(ennf_transformation,[],[f57]) ).
fof(f83,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(ennf_transformation,[],[f56]) ).
fof(f84,plain,
( ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_m10 ),
inference(ennf_transformation,[],[f55]) ).
fof(f86,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f31]) ).
fof(f87,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f32]) ).
fof(f88,plain,
( axiom_5
| ~ is_a_theorem(implies(possibly(sK0),necessarily(possibly(sK0)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f78]) ).
fof(f89,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f70]) ).
fof(f90,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f71]) ).
fof(f92,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1))
| ~ modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f74]) ).
fof(f93,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(cnf_transformation,[],[f76]) ).
fof(f94,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1))
| ~ substitution_strict_equiv ),
inference(cnf_transformation,[],[f77]) ).
fof(f95,plain,
( axiom_5
| ~ is_a_theorem(implies(possibly(sK0),necessarily(possibly(sK0)))) ),
inference(cnf_transformation,[],[f88]) ).
fof(f96,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(cnf_transformation,[],[f79]) ).
fof(f97,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(cnf_transformation,[],[f80]) ).
fof(f98,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(cnf_transformation,[],[f81]) ).
fof(f99,plain,
! [X0] :
( is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(cnf_transformation,[],[f82]) ).
fof(f100,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(cnf_transformation,[],[f83]) ).
fof(f101,plain,
! [X0] :
( is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_m10 ),
inference(cnf_transformation,[],[f84]) ).
fof(f103,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f86]) ).
fof(f104,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f87]) ).
fof(f107,plain,
op_strict_implies,
inference(cnf_transformation,[],[f36]) ).
fof(f109,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f38]) ).
fof(f110,plain,
modus_ponens_strict_implies,
inference(cnf_transformation,[],[f39]) ).
fof(f111,plain,
substitution_strict_equiv,
inference(cnf_transformation,[],[f40]) ).
fof(f112,plain,
adjunction,
inference(cnf_transformation,[],[f41]) ).
fof(f113,plain,
axiom_m1,
inference(cnf_transformation,[],[f42]) ).
fof(f114,plain,
axiom_m2,
inference(cnf_transformation,[],[f43]) ).
fof(f115,plain,
axiom_m3,
inference(cnf_transformation,[],[f44]) ).
fof(f116,plain,
axiom_m4,
inference(cnf_transformation,[],[f45]) ).
fof(f117,plain,
axiom_m5,
inference(cnf_transformation,[],[f46]) ).
fof(f118,plain,
axiom_m10,
inference(cnf_transformation,[],[f47]) ).
fof(f119,plain,
op_or,
inference(cnf_transformation,[],[f48]) ).
fof(f120,plain,
op_implies_and,
inference(cnf_transformation,[],[f49]) ).
fof(f122,plain,
~ axiom_5,
inference(cnf_transformation,[],[f54]) ).
fof(f123,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f104,f109]) ).
fof(f124,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f103,f107]) ).
fof(f126,plain,
! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))),
inference(forward_subsumption_resolution,[],[f101,f118]) ).
fof(f127,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))),
inference(forward_subsumption_resolution,[],[f100,f117]) ).
fof(f128,plain,
! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f99,f116]) ).
fof(f129,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))),
inference(forward_subsumption_resolution,[],[f98,f115]) ).
fof(f130,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f97,f114]) ).
fof(f131,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f96,f113]) ).
fof(f132,plain,
~ is_a_theorem(implies(possibly(sK0),necessarily(possibly(sK0)))),
inference(forward_subsumption_resolution,[],[f95,f122]) ).
fof(f133,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f94,f111]) ).
fof(f134,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f93,f112]) ).
fof(f135,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f92,f110]) ).
fof(f137,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f90,f120]) ).
fof(f138,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f89,f119]) ).
fof(f139,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f138,f137]) ).
fof(f148,plain,
! [X0,X1] : strict_implies(not(X0),X1) = necessarily(or(X0,X1)),
inference(superposition,[],[f124,f139]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(and(strict_implies(X0,X1),strict_implies(X1,X2)))
| is_a_theorem(strict_implies(X0,X2)) ),
inference(resolution,[],[f127,f135]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(strict_implies(X0,X2))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f150,f134]) ).
fof(f153,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(X0,and(X1,X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f151,f128]) ).
fof(f170,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X1,X0))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_equiv(X0,X1)) ),
inference(superposition,[],[f134,f123]) ).
fof(f174,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(and(X0,X0),X0))
| is_a_theorem(strict_equiv(and(X0,X0),X0)) ),
inference(resolution,[],[f170,f128]) ).
fof(f176,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| is_a_theorem(strict_equiv(and(X0,X1),and(X1,X0))) ),
inference(resolution,[],[f170,f131]) ).
fof(f178,plain,
! [X0,X1] : is_a_theorem(strict_equiv(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f176,f131]) ).
fof(f179,plain,
! [X0] : is_a_theorem(strict_equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f174,f130]) ).
fof(f237,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f133,f179]) ).
fof(f238,plain,
! [X0,X1] : and(X0,X1) = and(X1,X0),
inference(resolution,[],[f133,f178]) ).
fof(f248,plain,
! [X0] : is_a_theorem(strict_implies(X0,X0)),
inference(superposition,[],[f131,f237]) ).
fof(f254,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f137,f237]) ).
fof(f262,plain,
! [X0] : not(not(X0)) = or(X0,X0),
inference(forward_demodulation,[],[f254,f139]) ).
fof(f294,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X1)),
inference(superposition,[],[f130,f238]) ).
fof(f302,plain,
! [X0,X1] : implies(X1,X0) = not(and(not(X0),X1)),
inference(superposition,[],[f137,f238]) ).
fof(f304,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X1,and(X2,X0)))),
inference(superposition,[],[f129,f238]) ).
fof(f336,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(superposition,[],[f137,f302]) ).
fof(f346,plain,
! [X0,X1] : implies(not(X0),X1) = or(X1,X0),
inference(forward_demodulation,[],[f336,f139]) ).
fof(f354,plain,
! [X0,X1] : or(X0,X1) = or(X1,X0),
inference(forward_demodulation,[],[f346,f139]) ).
fof(f360,plain,
! [X0,X1] : necessarily(or(X0,X1)) = strict_implies(not(X1),X0),
inference(superposition,[],[f148,f354]) ).
fof(f362,plain,
! [X0,X1] : strict_implies(not(X0),X1) = strict_implies(not(X1),X0),
inference(forward_demodulation,[],[f360,f148]) ).
fof(f391,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),X1))
| ~ is_a_theorem(strict_implies(X0,not(X1)))
| is_a_theorem(strict_equiv(X0,not(X1))) ),
inference(superposition,[],[f170,f362]) ).
fof(f392,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(not(and(X0,X0)),X1))
| ~ is_a_theorem(strict_implies(not(X1),X0)) ),
inference(superposition,[],[f153,f362]) ).
fof(f394,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X1),X0))
| is_a_theorem(strict_implies(not(X0),X1)) ),
inference(forward_demodulation,[],[f392,f237]) ).
fof(f399,plain,
! [X0] : is_a_theorem(strict_implies(not(not(X0)),X0)),
inference(resolution,[],[f394,f248]) ).
fof(f414,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,not(not(X1))))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f399,f151]) ).
fof(f464,plain,
! [X0] : strict_implies(not(X0),X0) = necessarily(not(not(X0))),
inference(superposition,[],[f148,f262]) ).
fof(f702,plain,
! [X0] : is_a_theorem(strict_implies(not(not(not(not(X0)))),X0)),
inference(resolution,[],[f414,f399]) ).
fof(f786,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(X2,and(X0,X1)),and(X1,and(X0,X2)))),
inference(superposition,[],[f304,f238]) ).
fof(f1448,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X2,and(X1,X0))))
| is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X2,and(X1,X0)))) ),
inference(resolution,[],[f786,f170]) ).
fof(f1467,plain,
! [X2,X0,X1] : is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X2,and(X1,X0)))),
inference(forward_subsumption_resolution,[],[f1448,f786]) ).
fof(f1468,plain,
! [X2,X0,X1] : and(X0,and(X1,X2)) = and(X2,and(X1,X0)),
inference(resolution,[],[f1467,f133]) ).
fof(f1498,plain,
! [X0,X1] : and(X1,X0) = and(X0,and(X0,X1)),
inference(superposition,[],[f1468,f237]) ).
fof(f1933,plain,
! [X0,X1] : not(and(X0,not(X1))) = implies(and(not(X1),X0),X1),
inference(superposition,[],[f302,f1498]) ).
fof(f1938,plain,
! [X0,X1] : implies(X0,X1) = implies(and(not(X1),X0),X1),
inference(forward_demodulation,[],[f1933,f137]) ).
fof(f2015,plain,
! [X0,X1] : implies(X0,X1) = implies(and(X0,not(X1)),X1),
inference(superposition,[],[f1938,f238]) ).
fof(f2025,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(and(not(X1),X0),X1),
inference(superposition,[],[f124,f1938]) ).
fof(f2028,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(and(not(X1),X0),X1),
inference(forward_demodulation,[],[f2025,f124]) ).
fof(f2067,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(and(X0,not(X1)),X1),
inference(superposition,[],[f124,f2015]) ).
fof(f2070,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(and(X0,not(X1)),X1),
inference(forward_demodulation,[],[f2067,f124]) ).
fof(f2117,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X2,and(X0,not(X1))))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(X2,X1)) ),
inference(superposition,[],[f151,f2070]) ).
fof(f2143,plain,
! [X2,X0,X1] : strict_implies(and(X1,X0),X2) = strict_implies(and(X0,and(X1,not(X2))),X2),
inference(superposition,[],[f2028,f1468]) ).
fof(f2372,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(and(X2,and(X0,not(X1))),X1)) ),
inference(resolution,[],[f2117,f294]) ).
fof(f2396,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(X0,X2),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f2372,f2143]) ).
fof(f2423,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X1),X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f2396,f2028]) ).
fof(f2439,plain,
! [X0,X1] :
( ~ is_a_theorem(necessarily(not(not(X0))))
| is_a_theorem(strict_implies(X1,X0)) ),
inference(superposition,[],[f2423,f464]) ).
fof(f5602,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(not(not(not(X0))),not(X0)))
| is_a_theorem(strict_equiv(not(not(not(X0))),not(X0))) ),
inference(resolution,[],[f702,f391]) ).
fof(f5652,plain,
! [X0] : is_a_theorem(strict_equiv(not(not(not(X0))),not(X0))),
inference(forward_subsumption_resolution,[],[f5602,f399]) ).
fof(f5654,plain,
! [X0] : not(X0) = not(not(not(X0))),
inference(resolution,[],[f5652,f133]) ).
fof(f5671,plain,
! [X0,X1] : implies(X0,X1) = not(not(implies(X0,X1))),
inference(superposition,[],[f5654,f302]) ).
fof(f5811,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(necessarily(implies(X0,X1)))
| is_a_theorem(strict_implies(X2,implies(X0,X1))) ),
inference(superposition,[],[f2439,f5671]) ).
fof(f5909,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(X2,implies(X0,X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f5811,f124]) ).
fof(f6478,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f5909,f135]) ).
fof(f6526,definition,
( spl1_20
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl1_20])],[avatar_definition]) ).
fof(f6527,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl1_20 ),
inference(avatar_component_clause,[],[f6526]) ).
fof(f6529,definition,
( spl1_21
<=> ! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_21])],[avatar_definition]) ).
fof(f6530,plain,
( ! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_21 ),
inference(avatar_component_clause,[],[f6529]) ).
fof(f6531,plain,
( spl1_20
| spl1_21 ),
inference(avatar_split_clause,[],[f6478,f6529,f6526]) ).
fof(f6598,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ spl1_21 ),
inference(resolution,[],[f6530,f126]) ).
fof(f6686,plain,
( $false
| ~ spl1_21 ),
inference(resolution,[],[f6598,f132]) ).
fof(f6692,plain,
~ spl1_21,
inference(avatar_contradiction_clause,[],[f6686]) ).
fof(f6710,plain,
( $false
| ~ spl1_20 ),
inference(resolution,[],[f6527,f248]) ).
fof(f6838,plain,
~ spl1_20,
inference(avatar_contradiction_clause,[],[f6710]) ).
cnf(s23,plain,
( spl1_20
| spl1_21 ),
inference(sat_conversion,[],[f6531]) ).
cnf(s26,plain,
~ spl1_21,
inference(sat_conversion,[],[f6692]) ).
cnf(s84,plain,
~ spl1_20,
inference(sat_conversion,[],[f6838]) ).
cnf(s89,plain,
$false,
inference(rat,[],[s23,s26,s84]) ).
fof(f6842,plain,
$false,
inference(avatar_sat_refutation,[],[s89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL573+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 16:03:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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
% 10.32/2.35 % (2216405)Detected formulas, will run a generic FOF schedule.
% 10.32/2.35 % (2216411)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=2466660392:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 10.32/2.35 % (2216410)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=1223577423:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 10.32/2.35 % (2216415)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=400578250:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 10.32/2.35 % (2216414)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2232407449:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 10.32/2.35 % (2216413)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2843537521:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 10.32/2.35 % (2216416)dis-21_1_sil=8000:lcm=predicate:random_seed=633033254: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)
% 10.32/2.35 % (2216412)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=2911658419:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 10.32/2.35 % (2216414)Refutation not found, incomplete strategy
% 10.32/2.35 % (2216414)------------------------------
% 10.32/2.35 % (2216414)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.32/2.35 % (2216414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.32/2.35 % (2216414)CaDiCaL version: 2.1.3
% 10.32/2.35 % (2216414)Termination reason: Refutation not found, incomplete strategy
% 10.32/2.35 % (2216414)Time elapsed: 0.0000 s
% 10.32/2.35 % (2216414)Peak memory usage: 87 MB
% 10.32/2.35 % (2216413)Refutation not found, incomplete strategy
% 10.32/2.35 % (2216413)------------------------------
% 10.32/2.35 % (2216413)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.32/2.35 % (2216413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.32/2.35 % (2216413)CaDiCaL version: 2.1.3
% 10.32/2.35 % (2216413)Termination reason: Refutation not found, incomplete strategy
% 10.32/2.35 % (2216413)Time elapsed: 0.0000 s
% 10.32/2.35 % (2216413)Peak memory usage: 87 MB
% 10.32/2.35 % (2216416)Refutation not found, incomplete strategy
% 10.32/2.35 % (2216416)------------------------------
% 10.32/2.35 % (2216416)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.32/2.35 % (2216416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.32/2.35 % (2216416)CaDiCaL version: 2.1.3
% 10.32/2.35 % (2216416)Termination reason: Refutation not found, incomplete strategy
% 10.32/2.35 % (2216416)Time elapsed: 0.001 s
% 10.32/2.35 % (2216416)Peak memory usage: 88 MB
% 10.32/2.35 % (2216416)Instructions burned: 1 (million)
% 10.32/2.35 % (2216415)Instruction limit reached!
% 10.32/2.35 % (2216415)------------------------------
% 10.32/2.35 % (2216415)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.32/2.35 % (2216415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.32/2.35 % (2216415)CaDiCaL version: 2.1.3
% 10.32/2.35 % (2216415)Termination reason: Instruction limit
% 10.32/2.35 % (2216415)Termination phase: Saturation
% 10.32/2.35 % (2216415)Time elapsed: 0.096 s
% 10.32/2.35 % (2216415)Peak memory usage: 90 MB
% 10.32/2.35 % (2216415)Instructions burned: 139 (million)
% 10.32/2.35 % (2216424)lrs+10_1_sil=8000:sp=occurrence:random_seed=2076042319:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 10.32/2.35 % (2216424)Refutation not found, incomplete strategy
% 10.32/2.35 % (2216424)------------------------------
% 10.32/2.35 % (2216424)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.32/2.35 % (2216424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.32/2.35 % (2216424)CaDiCaL version: 2.1.3
% 10.32/2.35 % (2216424)Termination reason: Refutation not found, incomplete strategy
% 10.32/2.35 % (2216424)Time elapsed: 0.001 s
% 10.32/2.35 % (2216424)Peak memory usage: 87 MB
% 10.32/2.35 % (2216416)------------------------------
% 10.32/2.35 % (2216416)------------------------------
% 10.32/2.35 % (2216414)------------------------------
% 10.32/2.35 % (2216414)------------------------------
% 10.81/2.44 % (2216413)------------------------------
% 10.81/2.44 % (2216413)------------------------------
% 10.81/2.44 % (2216428)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=191326022:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 10.81/2.44 % (2216427)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1391093503:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 10.81/2.44 % (2216427)Refutation not found, incomplete strategy
% 10.81/2.44 % (2216427)------------------------------
% 10.81/2.44 % (2216427)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.44 % (2216427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.44 % (2216427)CaDiCaL version: 2.1.3
% 10.81/2.44 % (2216427)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.44 % (2216427)Time elapsed: 0.001 s
% 10.81/2.44 % (2216427)Peak memory usage: 87 MB
% 10.81/2.44 % (2216426)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4181076839:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 10.81/2.45 % (2216426)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216426)------------------------------
% 10.81/2.45 % (2216426)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216426)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216426)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216426)Time elapsed: 0.001 s
% 10.81/2.45 % (2216426)Peak memory usage: 87 MB
% 10.81/2.45 % (2216428)Instruction limit reached!
% 10.81/2.45 % (2216428)------------------------------
% 10.81/2.45 % (2216428)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216428)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216428)Termination reason: Instruction limit
% 10.81/2.45 % (2216428)Termination phase: Saturation
% 10.81/2.45 % (2216428)Time elapsed: 0.077 s
% 10.81/2.45 % (2216428)Peak memory usage: 92 MB
% 10.81/2.45 % (2216428)Instructions burned: 250 (million)
% 10.81/2.45 % (2216424)------------------------------
% 10.81/2.45 % (2216424)------------------------------
% 10.81/2.45 % (2216432)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1841454755:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 10.81/2.45 % (2216432)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216432)------------------------------
% 10.81/2.45 % (2216432)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216432)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216432)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216432)Time elapsed: 0.0000 s
% 10.81/2.45 % (2216432)Peak memory usage: 87 MB
% 10.81/2.45 % (2216412)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216412)------------------------------
% 10.81/2.45 % (2216412)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216412)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216412)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216412)Time elapsed: 0.568 s
% 10.81/2.45 % (2216412)Peak memory usage: 127 MB
% 10.81/2.45 % (2216412)Instructions burned: 829 (million)
% 10.81/2.45 % (2216433)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2247417268:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 10.81/2.45 % (2216427)------------------------------
% 10.81/2.45 % (2216427)------------------------------
% 10.81/2.45 % (2216426)------------------------------
% 10.81/2.45 % (2216426)------------------------------
% 10.81/2.45 % (2216432)------------------------------
% 10.81/2.45 % (2216432)------------------------------
% 10.81/2.45 % (2216438)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=350082361:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 10.81/2.45 % (2216438)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216438)------------------------------
% 10.81/2.45 % (2216438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216438)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216438)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216438)Time elapsed: 0.001 s
% 10.81/2.45 % (2216438)Peak memory usage: 88 MB
% 10.81/2.45 % (2216438)Instructions burned: 1 (million)
% 10.81/2.45 % (2216436)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3530694985:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 10.81/2.45 % (2216437)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=745708393:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 10.81/2.45 % (2216436)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216436)------------------------------
% 10.81/2.45 % (2216436)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216436)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216436)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216436)Time elapsed: 0.001 s
% 10.81/2.45 % (2216436)Peak memory usage: 88 MB
% 10.81/2.45 % (2216412)------------------------------
% 10.81/2.45 % (2216412)------------------------------
% 10.81/2.45 % (2216437)Instruction limit reached!
% 10.81/2.45 % (2216437)------------------------------
% 10.81/2.45 % (2216437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216437)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216437)Termination reason: Instruction limit
% 10.81/2.45 % (2216437)Termination phase: Saturation
% 10.81/2.45 % (2216437)Time elapsed: 0.069 s
% 10.81/2.45 % (2216437)Peak memory usage: 88 MB
% 10.81/2.45 % (2216437)Instructions burned: 127 (million)
% 10.81/2.45 % (2216438)------------------------------
% 10.81/2.45 % (2216438)------------------------------
% 10.81/2.45 % (2216442)lrs+10_1_sil=8000:sp=occurrence:random_seed=3140877621:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 10.81/2.45 % (2216443)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2848354873:i=437:sd=1:aac=none:ss=included_2990 on theBenchmark for (2990ds/437Mi)
% 10.81/2.45 % (2216443)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216443)------------------------------
% 10.81/2.45 % (2216443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216443)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216443)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216443)Time elapsed: 0.001 s
% 10.81/2.45 % (2216443)Peak memory usage: 88 MB
% 10.81/2.45 % (2216444)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=958455066:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 10.81/2.45 % (2216436)------------------------------
% 10.81/2.45 % (2216436)------------------------------
% 10.81/2.45 % (2216448)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=1213511045:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2988 on theBenchmark for (2988ds/134Mi)
% 10.81/2.45 % (2216448)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216448)------------------------------
% 10.81/2.45 % (2216448)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216448)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216448)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216448)Time elapsed: 0.001 s
% 10.81/2.45 % (2216448)Peak memory usage: 89 MB
% 10.81/2.45 % (2216410)First to succeed.
% 10.81/2.45 % (2216410)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2216405"
% 10.81/2.45 % (2216443)------------------------------
% 10.81/2.45 % (2216443)------------------------------
% 10.81/2.45 % (2216450)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=1131522057:st=8:i=592:sd=3:ep=RST:ss=axioms_2986 on theBenchmark for (2986ds/592Mi)
% 10.81/2.45 % (2216450)Refutation not found, incomplete strategy
% 10.81/2.45 % (2216450)------------------------------
% 10.81/2.45 % (2216450)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.81/2.45 % (2216450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.81/2.45 % (2216450)CaDiCaL version: 2.1.3
% 10.81/2.45 % (2216450)Termination reason: Refutation not found, incomplete strategy
% 10.81/2.45 % (2216450)Time elapsed: 0.001 s
% 10.81/2.45 % (2216450)Peak memory usage: 88 MB
% 10.81/2.45 % (2216448)------------------------------
% 10.81/2.45 % (2216448)------------------------------
% 10.81/2.45 % (2216410)Refutation found. Thanks to Tanya!
% 10.81/2.45 % SZS status Theorem for theBenchmark
% 10.81/2.45 % SZS output start Proof for theBenchmark
% See solution above
% 11.89/2.67 % (2216410)------------------------------
% 11.89/2.67 % (2216410)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.89/2.67 % (2216410)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.89/2.67 % (2216410)CaDiCaL version: 2.1.3
% 11.89/2.67 % (2216410)Termination reason: Refutation
% 11.89/2.67 % (2216410)Time elapsed: 1.199 s
% 11.89/2.67 % (2216410)Peak memory usage: 137 MB
% 11.89/2.67 % (2216410)Instructions burned: 1773 (million)
% 11.89/2.67 % (2216410)------------------------------
% 11.89/2.67 % (2216410)------------------------------
% 11.89/2.67 % (2216405)Success in time 1.599 s
% 11.89/2.67 % Vampire exiting
%------------------------------------------------------------------------------