%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL563+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 : n012.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:04 AM UTC 2026
% Result : Theorem 10.55s 2.08s
% Output : Refutation 11.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 59
% Number of leaves : 30
% Syntax : Number of formulae : 221 ( 117 unt; 2 def)
% Number of atoms : 363 ( 74 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 258 ( 116 ~; 107 |; 4 &)
% ( 11 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 17 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 379 ( 0 sgn 377 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_3) ).
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(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(f33,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(f34,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(f35,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(f45,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(f46,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m2) ).
fof(f47,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(f48,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m4) ).
fof(f49,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(f57,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(f58,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(f62,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f64,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f65,axiom,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f66,axiom,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f67,axiom,
adjunction,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f68,axiom,
axiom_m1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f69,axiom,
axiom_m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f70,axiom,
axiom_m3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m3) ).
fof(f71,axiom,
axiom_m4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f72,axiom,
axiom_m5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m5) ).
fof(f73,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f74,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f75,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f77,conjecture,
equivalence_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_3) ).
fof(f78,negated_conjecture,
~ equivalence_3,
inference(negated_conjecture,[status(cth)],[f77]) ).
fof(f79,plain,
~ equivalence_3,
inference(flattening,[],[f78]) ).
fof(f80,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,[],[f49]) ).
fof(f81,plain,
( axiom_m4
=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
fof(f82,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,[],[f47]) ).
fof(f83,plain,
( axiom_m2
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f84,plain,
( axiom_m1
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f85,plain,
( substitution_strict_equiv
=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f35]) ).
fof(f86,plain,
( adjunction
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(X1) )
=> is_a_theorem(and(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f87,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,[],[f33]) ).
fof(f88,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
=> equivalence_3 ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f95,plain,
( equivalence_3
| ? [X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(ennf_transformation,[],[f88]) ).
fof(f96,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f97,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f98,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f99,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,[],[f87]) ).
fof(f100,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1)) )
| ~ modus_ponens_strict_implies ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(ennf_transformation,[],[f86]) ).
fof(f102,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1)) )
| ~ substitution_strict_equiv ),
inference(ennf_transformation,[],[f85]) ).
fof(f104,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(ennf_transformation,[],[f84]) ).
fof(f105,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(ennf_transformation,[],[f83]) ).
fof(f106,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(ennf_transformation,[],[f82]) ).
fof(f107,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(ennf_transformation,[],[f81]) ).
fof(f108,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,[],[f80]) ).
fof(f110,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f57]) ).
fof(f111,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f58]) ).
fof(f112,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f95]) ).
fof(f114,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))) ),
inference(cnf_transformation,[],[f112]) ).
fof(f115,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f96]) ).
fof(f116,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f97]) ).
fof(f117,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f98]) ).
fof(f118,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,[],[f100]) ).
fof(f119,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(cnf_transformation,[],[f102]) ).
fof(f120,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1))
| ~ substitution_strict_equiv ),
inference(cnf_transformation,[],[f103]) ).
fof(f121,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(cnf_transformation,[],[f104]) ).
fof(f122,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(cnf_transformation,[],[f105]) ).
fof(f123,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(cnf_transformation,[],[f106]) ).
fof(f124,plain,
! [X0] :
( is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(cnf_transformation,[],[f107]) ).
fof(f125,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,[],[f108]) ).
fof(f127,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f110]) ).
fof(f128,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f111]) ).
fof(f131,plain,
op_strict_implies,
inference(cnf_transformation,[],[f62]) ).
fof(f133,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f64]) ).
fof(f134,plain,
modus_ponens_strict_implies,
inference(cnf_transformation,[],[f65]) ).
fof(f135,plain,
substitution_strict_equiv,
inference(cnf_transformation,[],[f66]) ).
fof(f136,plain,
adjunction,
inference(cnf_transformation,[],[f67]) ).
fof(f137,plain,
axiom_m1,
inference(cnf_transformation,[],[f68]) ).
fof(f138,plain,
axiom_m2,
inference(cnf_transformation,[],[f69]) ).
fof(f139,plain,
axiom_m3,
inference(cnf_transformation,[],[f70]) ).
fof(f140,plain,
axiom_m4,
inference(cnf_transformation,[],[f71]) ).
fof(f141,plain,
axiom_m5,
inference(cnf_transformation,[],[f72]) ).
fof(f142,plain,
op_or,
inference(cnf_transformation,[],[f73]) ).
fof(f143,plain,
op_implies_and,
inference(cnf_transformation,[],[f74]) ).
fof(f144,plain,
op_equiv,
inference(cnf_transformation,[],[f75]) ).
fof(f146,plain,
~ equivalence_3,
inference(cnf_transformation,[],[f79]) ).
fof(f147,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f128,f133]) ).
fof(f148,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f127,f131]) ).
fof(f150,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,[],[f125,f141]) ).
fof(f151,plain,
! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f124,f140]) ).
fof(f152,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))),
inference(forward_subsumption_resolution,[],[f123,f139]) ).
fof(f153,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f122,f138]) ).
fof(f154,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f121,f137]) ).
fof(f155,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f120,f135]) ).
fof(f156,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f119,f136]) ).
fof(f157,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f118,f134]) ).
fof(f158,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f117,f144]) ).
fof(f159,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f116,f143]) ).
fof(f160,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f115,f142]) ).
fof(f161,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))),
inference(forward_subsumption_resolution,[],[f114,f146]) ).
fof(f163,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f160,f159]) ).
fof(f168,plain,
! [X0,X1] : strict_implies(not(X0),X1) = necessarily(or(X0,X1)),
inference(superposition,[],[f148,f163]) ).
fof(f169,plain,
! [X0] : is_a_theorem(strict_implies(implies(X0,X0),equiv(X0,X0))),
inference(superposition,[],[f151,f158]) ).
fof(f173,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,[],[f150,f157]) ).
fof(f176,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,[],[f173,f156]) ).
fof(f178,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,implies(X1,X1)))
| is_a_theorem(strict_implies(X0,equiv(X1,X1))) ),
inference(resolution,[],[f176,f169]) ).
fof(f184,plain,
! [X0,X1] : is_a_theorem(strict_implies(equiv(X0,X1),implies(X0,X1))),
inference(superposition,[],[f153,f158]) ).
fof(f215,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,[],[f156,f147]) ).
fof(f218,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(and(X0,X0),X0))
| is_a_theorem(strict_equiv(and(X0,X0),X0)) ),
inference(resolution,[],[f215,f151]) ).
fof(f219,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(equiv(X0,X0),implies(X0,X0)))
| is_a_theorem(strict_equiv(equiv(X0,X0),implies(X0,X0))) ),
inference(resolution,[],[f215,f169]) ).
fof(f226,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,[],[f215,f154]) ).
fof(f227,plain,
! [X0,X1] : is_a_theorem(strict_equiv(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f226,f154]) ).
fof(f230,plain,
! [X0] : is_a_theorem(strict_equiv(equiv(X0,X0),implies(X0,X0))),
inference(forward_subsumption_resolution,[],[f219,f184]) ).
fof(f231,plain,
! [X0] : is_a_theorem(strict_equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f218,f153]) ).
fof(f316,plain,
! [X0] : equiv(X0,X0) = implies(X0,X0),
inference(resolution,[],[f155,f230]) ).
fof(f317,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f155,f231]) ).
fof(f318,plain,
! [X0,X1] : and(X0,X1) = and(X1,X0),
inference(resolution,[],[f155,f227]) ).
fof(f330,plain,
! [X0] : is_a_theorem(strict_implies(X0,X0)),
inference(superposition,[],[f154,f317]) ).
fof(f414,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X1)),
inference(superposition,[],[f153,f318]) ).
fof(f424,plain,
! [X0,X1] : implies(X1,X0) = not(and(not(X0),X1)),
inference(superposition,[],[f159,f318]) ).
fof(f427,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X1,and(X2,X0)))),
inference(superposition,[],[f152,f318]) ).
fof(f449,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,and(X1,X2)))
| is_a_theorem(strict_implies(X0,X2)) ),
inference(resolution,[],[f414,f176]) ).
fof(f480,plain,
! [X2,X0,X1] : not(and(implies(X0,X1),X2)) = implies(X2,and(not(X1),X0)),
inference(superposition,[],[f424,f424]) ).
fof(f486,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(superposition,[],[f159,f424]) ).
fof(f493,plain,
! [X0,X1] : implies(not(X0),X1) = or(X1,X0),
inference(forward_demodulation,[],[f486,f163]) ).
fof(f497,plain,
! [X0,X1] : or(X0,X1) = or(X1,X0),
inference(forward_demodulation,[],[f493,f163]) ).
fof(f503,plain,
! [X0,X1] : necessarily(or(X0,X1)) = strict_implies(not(X1),X0),
inference(superposition,[],[f168,f497]) ).
fof(f505,plain,
! [X0,X1] : strict_implies(not(X0),X1) = strict_implies(not(X1),X0),
inference(forward_demodulation,[],[f503,f168]) ).
fof(f510,plain,
! [X2,X0,X1] : strict_implies(implies(X0,X1),X2) = strict_implies(not(X2),and(X0,not(X1))),
inference(superposition,[],[f505,f159]) ).
fof(f537,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),X1))
| ~ is_a_theorem(strict_implies(X2,not(X1)))
| is_a_theorem(strict_implies(X2,X0)) ),
inference(superposition,[],[f176,f505]) ).
fof(f551,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,not(not(X1))))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f537,f330]) ).
fof(f561,plain,
! [X0] : is_a_theorem(strict_implies(not(not(X0)),X0)),
inference(resolution,[],[f551,f330]) ).
fof(f893,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(X0,and(X2,X1)),and(X2,and(X0,X1)))),
inference(superposition,[],[f427,f318]) ).
fof(f929,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(implies(X0,X1),X2))
| is_a_theorem(strict_implies(not(X2),not(X1))) ),
inference(superposition,[],[f449,f510]) ).
fof(f1069,plain,
! [X0,X1] : is_a_theorem(strict_implies(not(implies(X0,X1)),not(X1))),
inference(resolution,[],[f929,f330]) ).
fof(f1143,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X1,and(X0,X2))))
| is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X1,and(X0,X2)))) ),
inference(resolution,[],[f893,f215]) ).
fof(f1162,plain,
! [X2,X0,X1] : is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X1,and(X0,X2)))),
inference(forward_subsumption_resolution,[],[f1143,f893]) ).
fof(f1163,plain,
! [X2,X0,X1] : and(X0,and(X1,X2)) = and(X1,and(X0,X2)),
inference(resolution,[],[f1162,f155]) ).
fof(f1193,plain,
! [X0,X1] : and(X1,X0) = and(X0,and(X1,X0)),
inference(superposition,[],[f1163,f317]) ).
fof(f1243,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X0,and(X2,X1)))),
inference(superposition,[],[f427,f1163]) ).
fof(f1267,plain,
! [X2,X0,X1] : and(X0,and(X1,X2)) = and(and(X0,X2),X1),
inference(superposition,[],[f318,f1163]) ).
fof(f1280,plain,
! [X2,X0,X1] : implies(and(X0,X2),X1) = not(and(X0,and(not(X1),X2))),
inference(superposition,[],[f424,f1163]) ).
fof(f1317,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(and(X0,and(X1,X2)),and(X0,and(X2,X1))))
| is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X0,and(X2,X1)))) ),
inference(resolution,[],[f1243,f215]) ).
fof(f1357,plain,
! [X2,X0,X1] : is_a_theorem(strict_equiv(and(X0,and(X1,X2)),and(X0,and(X2,X1)))),
inference(forward_subsumption_resolution,[],[f1317,f1243]) ).
fof(f1362,plain,
! [X2,X0,X1] : and(X0,and(X1,X2)) = and(X0,and(X2,X1)),
inference(resolution,[],[f1357,f155]) ).
fof(f2277,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X1,X0),equiv(X0,X1)),
inference(superposition,[],[f1193,f158]) ).
fof(f2334,plain,
! [X0,X1] : not(and(X0,not(X1))) = implies(and(X0,not(X1)),X1),
inference(superposition,[],[f424,f1193]) ).
fof(f2337,plain,
! [X0,X1] : implies(X0,X1) = implies(and(X0,not(X1)),X1),
inference(forward_demodulation,[],[f2334,f159]) ).
fof(f2410,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(and(X0,not(X1)),X1),
inference(superposition,[],[f148,f2337]) ).
fof(f2434,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(and(X0,not(X1)),X1),
inference(forward_demodulation,[],[f2410,f148]) ).
fof(f2442,plain,
! [X0,X1] : strict_implies(X1,X0) = strict_implies(and(not(X0),X1),X0),
inference(superposition,[],[f2434,f318]) ).
fof(f2456,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,[],[f176,f2434]) ).
fof(f2530,plain,
! [X2,X0,X1] : strict_implies(and(X0,X2),X1) = strict_implies(and(X0,and(not(X1),X2)),X1),
inference(superposition,[],[f2442,f1163]) ).
fof(f2567,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(not(not(and(X0,not(X1)))),X1)) ),
inference(resolution,[],[f2456,f561]) ).
fof(f2570,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(and(and(X0,not(X1)),X2),X1)) ),
inference(resolution,[],[f2456,f153]) ).
fof(f2598,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(X0,and(X2,not(X1))),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f2570,f1267]) ).
fof(f2600,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(not(implies(X0,X1)),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f2567,f159]) ).
fof(f2606,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(X2,implies(X0,X1)))
| ~ is_a_theorem(strict_implies(X2,not(X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f2600,f537]) ).
fof(f2750,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(X0,and(not(X1),X2)),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f2598,f1362]) ).
fof(f2760,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,not(X1)),X1))
| ~ is_a_theorem(strict_implies(not(X1),X1)) ),
inference(superposition,[],[f2598,f2442]) ).
fof(f2761,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X1),X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f2760,f2434]) ).
fof(f2766,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(X0,X2),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f2750,f2530]) ).
fof(f2816,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(superposition,[],[f2766,f1193]) ).
fof(f2829,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(strict_implies(X2,and(X3,X0)))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(X2,X1)) ),
inference(resolution,[],[f2816,f176]) ).
fof(f3493,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(not(implies(X0,X1)),not(X1)))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(X2,implies(X0,X1))) ),
inference(resolution,[],[f2606,f2761]) ).
fof(f3514,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(X2,implies(X0,X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f3493,f1069]) ).
fof(f3518,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X0))
| is_a_theorem(strict_implies(X1,equiv(X0,X0))) ),
inference(resolution,[],[f3514,f178]) ).
fof(f3572,definition,
( spl2_5
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f3573,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f3572]) ).
fof(f3579,plain,
! [X0,X1] : is_a_theorem(strict_implies(X1,equiv(X0,X0))),
inference(forward_subsumption_resolution,[],[f3518,f330]) ).
fof(f3580,plain,
! [X0,X1] : is_a_theorem(strict_implies(X1,implies(X0,X0))),
inference(forward_demodulation,[],[f3579,f316]) ).
fof(f3586,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X1)) ),
inference(resolution,[],[f3580,f157]) ).
fof(f3619,definition,
( spl2_8
<=> ! [X2] : is_a_theorem(implies(X2,X2)) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f3620,plain,
( ! [X2] : is_a_theorem(implies(X2,X2))
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f3619]) ).
fof(f3622,plain,
( spl2_8
| spl2_5 ),
inference(avatar_split_clause,[],[f3586,f3572,f3619]) ).
fof(f10772,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(strict_implies(not(and(X0,X1)),X2))
| ~ is_a_theorem(strict_implies(X1,X3))
| is_a_theorem(strict_implies(not(X2),X3)) ),
inference(superposition,[],[f2829,f505]) ).
fof(f11840,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),X1))
| ~ is_a_theorem(strict_implies(X0,X2))
| is_a_theorem(strict_implies(not(X1),X2)) ),
inference(superposition,[],[f10772,f317]) ).
fof(f11900,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(not(not(X0)),X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f11840,f330]) ).
fof(f11973,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X2,not(X1)))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_implies(X2,not(X0))) ),
inference(resolution,[],[f11900,f537]) ).
fof(f12035,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(not(X0),not(X1)))
| ~ is_a_theorem(strict_implies(X1,X0)) ),
inference(superposition,[],[f11900,f505]) ).
fof(f12269,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X1,X2))
| is_a_theorem(strict_implies(not(X2),not(X0)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f11973,f12035]) ).
fof(f12341,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X1,not(not(X0))))
| is_a_theorem(strict_implies(not(X0),not(X1))) ),
inference(resolution,[],[f12269,f561]) ).
fof(f14101,plain,
! [X0] : is_a_theorem(strict_implies(not(X0),not(not(not(X0))))),
inference(resolution,[],[f12341,f330]) ).
fof(f14348,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,[],[f14101,f215]) ).
fof(f14385,plain,
! [X0] : is_a_theorem(strict_equiv(not(not(not(X0))),not(X0))),
inference(forward_subsumption_resolution,[],[f14348,f561]) ).
fof(f14388,plain,
! [X0] : not(X0) = not(not(not(X0))),
inference(resolution,[],[f14385,f155]) ).
fof(f14422,plain,
! [X0,X1] : implies(X0,X1) = not(not(implies(X0,X1))),
inference(superposition,[],[f14388,f424]) ).
fof(f14454,plain,
! [X0,X1] : not(and(not(X0),X1)) = implies(X1,not(not(X0))),
inference(superposition,[],[f424,f14388]) ).
fof(f14544,plain,
! [X0,X1] : implies(X1,X0) = implies(X1,not(not(X0))),
inference(forward_demodulation,[],[f14454,f424]) ).
fof(f14601,plain,
! [X2,X0,X1] : not(and(implies(X0,X1),X2)) = implies(X2,not(implies(X0,X1))),
inference(superposition,[],[f424,f14422]) ).
fof(f14687,plain,
! [X2,X0,X1] : implies(X2,and(not(X1),X0)) = implies(X2,not(implies(X0,X1))),
inference(forward_demodulation,[],[f14601,f480]) ).
fof(f15955,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(X0,not(not(X1))),
inference(superposition,[],[f148,f14544]) ).
fof(f16047,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(X0,not(not(X1))),
inference(forward_demodulation,[],[f15955,f148]) ).
fof(f16249,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(not(X1)),X0))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_equiv(not(not(X1)),X0)) ),
inference(superposition,[],[f215,f16047]) ).
fof(f21994,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(X0,X0))
| is_a_theorem(strict_equiv(not(not(X0)),X0)) ),
inference(resolution,[],[f16249,f561]) ).
fof(f22102,plain,
! [X0] : is_a_theorem(strict_equiv(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[],[f21994,f330]) ).
fof(f22158,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f22102,f155]) ).
fof(f22218,plain,
! [X0,X1] : not(implies(X0,X1)) = and(not(X1),X0),
inference(superposition,[],[f22158,f424]) ).
fof(f22262,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X0,X1)),
inference(superposition,[],[f424,f22158]) ).
fof(f23309,plain,
! [X0] : not(X0) = implies(X0,not(X0)),
inference(superposition,[],[f22262,f317]) ).
fof(f23325,plain,
! [X0,X1] : not(equiv(X0,X1)) = implies(implies(X1,X0),not(implies(X0,X1))),
inference(superposition,[],[f22262,f158]) ).
fof(f23327,plain,
! [X0,X1] : not(equiv(X0,X1)) = implies(equiv(X0,X1),not(implies(X1,X0))),
inference(superposition,[],[f22262,f2277]) ).
fof(f23493,plain,
! [X0,X1] : not(equiv(X0,X1)) = implies(equiv(X0,X1),and(not(X0),X1)),
inference(forward_demodulation,[],[f23327,f14687]) ).
fof(f23495,plain,
! [X0,X1] : not(equiv(X0,X1)) = implies(implies(X1,X0),and(not(X1),X0)),
inference(forward_demodulation,[],[f23325,f14687]) ).
fof(f24291,plain,
! [X2,X0,X1] : implies(X2,implies(X1,X0)) = not(and(X2,and(not(X0),X1))),
inference(superposition,[],[f159,f22218]) ).
fof(f24448,plain,
! [X2,X0,X1] : implies(and(X2,X1),X0) = implies(X2,implies(X1,X0)),
inference(forward_demodulation,[],[f24291,f1280]) ).
fof(f24577,plain,
! [X2,X0,X1] : implies(equiv(X0,X1),X2) = implies(implies(X0,X1),implies(implies(X1,X0),X2)),
inference(superposition,[],[f24448,f158]) ).
fof(f32788,plain,
! [X0,X1] : implies(implies(X1,X0),not(implies(X0,X1))) = implies(equiv(X1,X0),not(implies(X0,X1))),
inference(superposition,[],[f24577,f23309]) ).
fof(f32801,plain,
~ is_a_theorem(implies(equiv(sK0,sK1),equiv(sK0,sK1))),
inference(superposition,[],[f161,f24577]) ).
fof(f32973,plain,
( $false
| ~ spl2_8 ),
inference(forward_subsumption_resolution,[],[f32801,f3620]) ).
fof(f32974,plain,
~ spl2_8,
inference(avatar_contradiction_clause,[],[f32973]) ).
fof(f32985,plain,
! [X0,X1] : implies(implies(X1,X0),not(implies(X0,X1))) = implies(equiv(X1,X0),and(not(X1),X0)),
inference(forward_demodulation,[],[f32788,f14687]) ).
fof(f33082,plain,
! [X0,X1] : not(equiv(X1,X0)) = implies(implies(X1,X0),not(implies(X0,X1))),
inference(forward_demodulation,[],[f32985,f23493]) ).
fof(f33145,plain,
! [X0,X1] : not(equiv(X1,X0)) = implies(implies(X1,X0),and(not(X1),X0)),
inference(forward_demodulation,[],[f33082,f14687]) ).
fof(f33184,plain,
! [X0,X1] : not(equiv(X0,X1)) = not(equiv(X1,X0)),
inference(forward_demodulation,[],[f33145,f23495]) ).
fof(f33445,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(not(implies(X2,equiv(X1,X0))),not(equiv(X0,X1)))),
inference(superposition,[],[f1069,f33184]) ).
fof(f33721,plain,
( $false
| ~ spl2_5 ),
inference(forward_subsumption_resolution,[],[f33445,f3573]) ).
fof(f33722,plain,
~ spl2_5,
inference(avatar_contradiction_clause,[],[f33721]) ).
cnf(s7,plain,
( spl2_5
| spl2_8 ),
inference(sat_conversion,[],[f3622]) ).
cnf(s67,plain,
~ spl2_8,
inference(sat_conversion,[],[f32974]) ).
cnf(s169,plain,
~ spl2_5,
inference(sat_conversion,[],[f33722]) ).
cnf(s184,plain,
$false,
inference(rat,[],[s7,s67,s169]) ).
fof(f33761,plain,
$false,
inference(avatar_sat_refutation,[],[s184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL563+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Sun Sep 27 16:01:34 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 6.31/1.57 % (2549072)Detected formulas, will run a generic FOF schedule.
% 6.31/1.57 % (2549077)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=911744616:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.31/1.57 % (2549083)dis-21_1_sil=8000:lcm=predicate:random_seed=1111663947: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)
% 6.31/1.57 % (2549079)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=2554533710:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.31/1.57 % (2549078)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=2671304274:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.31/1.57 % (2549082)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2665783007:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.31/1.57 % (2549080)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2303442866:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.31/1.57 % (2549081)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2028569157:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.31/1.57 % (2549081)Refutation not found, incomplete strategy
% 6.31/1.57 % (2549081)------------------------------
% 6.31/1.57 % (2549081)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.57 % (2549081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.57 % (2549081)CaDiCaL version: 2.1.3
% 6.31/1.57 % (2549081)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.57 % (2549081)Time elapsed: 0.0000 s
% 6.31/1.57 % (2549081)Peak memory usage: 86 MB
% 6.31/1.57 % (2549080)Refutation not found, incomplete strategy
% 6.31/1.57 % (2549080)------------------------------
% 6.31/1.57 % (2549080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.57 % (2549080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.57 % (2549080)CaDiCaL version: 2.1.3
% 6.31/1.57 % (2549080)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.57 % (2549080)Time elapsed: 0.0000 s
% 6.31/1.57 % (2549080)Peak memory usage: 87 MB
% 6.31/1.57 % (2549083)Refutation not found, incomplete strategy
% 6.31/1.57 % (2549083)------------------------------
% 6.31/1.57 % (2549083)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.57 % (2549083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.57 % (2549083)CaDiCaL version: 2.1.3
% 6.31/1.57 % (2549083)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.57 % (2549083)Time elapsed: 0.001 s
% 6.31/1.57 % (2549083)Peak memory usage: 88 MB
% 6.31/1.57 % (2549082)Instruction limit reached!
% 6.31/1.57 % (2549082)------------------------------
% 6.31/1.57 % (2549082)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.57 % (2549082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.57 % (2549082)CaDiCaL version: 2.1.3
% 6.31/1.57 % (2549082)Termination reason: Instruction limit
% 6.31/1.57 % (2549082)Termination phase: Saturation
% 6.31/1.57 % (2549082)Time elapsed: 0.049 s
% 6.31/1.57 % (2549082)Peak memory usage: 90 MB
% 6.31/1.57 % (2549082)Instructions burned: 140 (million)
% 6.31/1.57 % (2549091)lrs+10_1_sil=8000:sp=occurrence:random_seed=2128629554:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.31/1.57 % (2549091)Refutation not found, incomplete strategy
% 6.31/1.57 % (2549091)------------------------------
% 6.31/1.57 % (2549091)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.57 % (2549091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.57 % (2549091)CaDiCaL version: 2.1.3
% 6.31/1.57 % (2549091)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.57 % (2549091)Time elapsed: 0.001 s
% 6.31/1.57 % (2549091)Peak memory usage: 88 MB
% 6.31/1.57 % (2549083)------------------------------
% 6.31/1.57 % (2549083)------------------------------
% 6.31/1.57 % (2549081)------------------------------
% 6.31/1.57 % (2549081)------------------------------
% 6.31/1.57 % (2549080)------------------------------
% 8.80/1.97 % (2549080)------------------------------
% 8.80/1.97 % (2549094)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1537806748:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 8.80/1.97 % (2549095)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=2538236824:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 8.80/1.97 % (2549093)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2974903990:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.80/1.97 % (2549094)Refutation not found, incomplete strategy
% 8.80/1.97 % (2549094)------------------------------
% 8.80/1.97 % (2549094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.80/1.97 % (2549094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.80/1.97 % (2549094)CaDiCaL version: 2.1.3
% 8.80/1.97 % (2549094)Termination reason: Refutation not found, incomplete strategy
% 8.80/1.97 % (2549094)Time elapsed: 0.0000 s
% 8.80/1.97 % (2549094)Peak memory usage: 87 MB
% 8.80/1.97 % (2549093)Refutation not found, incomplete strategy
% 8.80/1.97 % (2549093)------------------------------
% 8.80/1.97 % (2549093)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.80/1.97 % (2549093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.80/1.97 % (2549093)CaDiCaL version: 2.1.3
% 8.80/1.97 % (2549093)Termination reason: Refutation not found, incomplete strategy
% 8.80/1.97 % (2549093)Time elapsed: 0.0000 s
% 8.80/1.97 % (2549093)Peak memory usage: 87 MB
% 8.80/1.97 % (2549091)------------------------------
% 8.80/1.97 % (2549091)------------------------------
% 8.80/1.97 % (2549079)Refutation not found, incomplete strategy
% 8.80/1.97 % (2549079)------------------------------
% 8.80/1.97 % (2549079)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.80/1.97 % (2549079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.80/1.97 % (2549079)CaDiCaL version: 2.1.3
% 8.80/1.97 % (2549079)Termination reason: Refutation not found, incomplete strategy
% 8.80/1.97 % (2549079)Time elapsed: 0.311 s
% 8.80/1.97 % (2549079)Peak memory usage: 125 MB
% 8.80/1.97 % (2549079)Instructions burned: 825 (million)
% 8.80/1.97 % (2549095)Instruction limit reached!
% 8.80/1.97 % (2549095)------------------------------
% 8.80/1.97 % (2549095)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.80/1.97 % (2549095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.80/1.97 % (2549095)CaDiCaL version: 2.1.3
% 8.80/1.97 % (2549095)Termination reason: Instruction limit
% 8.80/1.97 % (2549095)Termination phase: Saturation
% 8.80/1.97 % (2549095)Time elapsed: 0.079 s
% 8.80/1.97 % (2549095)Peak memory usage: 92 MB
% 8.80/1.97 % (2549095)Instructions burned: 251 (million)
% 8.80/1.97 % (2549094)------------------------------
% 8.80/1.97 % (2549094)------------------------------
% 8.80/1.97 % (2549093)------------------------------
% 8.80/1.97 % (2549093)------------------------------
% 8.80/1.97 % (2549099)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=193144773:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 8.80/1.97 % (2549099)Refutation not found, incomplete strategy
% 8.80/1.97 % (2549099)------------------------------
% 8.80/1.97 % (2549099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.80/1.97 % (2549099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.80/1.97 % (2549099)CaDiCaL version: 2.1.3
% 8.80/1.97 % (2549099)Termination reason: Refutation not found, incomplete strategy
% 8.80/1.97 % (2549099)Time elapsed: 0.0000 s
% 8.80/1.97 % (2549099)Peak memory usage: 87 MB
% 8.80/1.97 % (2549101)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2458569731:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 8.80/1.97 % (2549079)------------------------------
% 8.80/1.97 % (2549079)------------------------------
% 8.80/1.97 % (2549104)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2787080716:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 8.80/1.97 % (2549103)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=41575188:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 8.80/1.97 % (2549103)Refutation not found, incomplete strategy
% 8.80/1.97 % (2549103)------------------------------
% 8.80/1.97 % (2549103)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549103)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549103)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549103)Time elapsed: 0.001 s
% 10.55/2.08 % (2549103)Peak memory usage: 88 MB
% 10.55/2.08 % (2549104)Instruction limit reached!
% 10.55/2.08 % (2549104)------------------------------
% 10.55/2.08 % (2549104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549104)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549104)Termination reason: Instruction limit
% 10.55/2.08 % (2549104)Termination phase: Saturation
% 10.55/2.08 % (2549104)Time elapsed: 0.036 s
% 10.55/2.08 % (2549104)Peak memory usage: 88 MB
% 10.55/2.08 % (2549104)Instructions burned: 130 (million)
% 10.55/2.08 % (2549099)------------------------------
% 10.55/2.08 % (2549099)------------------------------
% 10.55/2.08 % (2549106)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1839408753:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 10.55/2.08 % (2549106)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549106)------------------------------
% 10.55/2.08 % (2549106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549106)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549106)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549106)Time elapsed: 0.0000 s
% 10.55/2.08 % (2549106)Peak memory usage: 87 MB
% 10.55/2.08 % (2549109)lrs+10_1_sil=8000:sp=occurrence:random_seed=992733759:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2993 on theBenchmark for (2993ds/907Mi)
% 10.55/2.08 % (2549103)------------------------------
% 10.55/2.08 % (2549103)------------------------------
% 10.55/2.08 % (2549110)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1056490251:i=437:sd=1:aac=none:ss=included_2993 on theBenchmark for (2993ds/437Mi)
% 10.55/2.08 % (2549110)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549110)------------------------------
% 10.55/2.08 % (2549110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549110)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549110)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549110)Time elapsed: 0.001 s
% 10.55/2.08 % (2549110)Peak memory usage: 88 MB
% 10.55/2.08 % (2549106)------------------------------
% 10.55/2.08 % (2549106)------------------------------
% 10.55/2.08 % (2549113)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3141861904:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 10.55/2.08 % (2549110)------------------------------
% 10.55/2.08 % (2549110)------------------------------
% 10.55/2.08 % (2549115)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=4006196134:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2991 on theBenchmark for (2991ds/134Mi)
% 10.55/2.08 % (2549115)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549115)------------------------------
% 10.55/2.08 % (2549115)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549115)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549115)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549115)Time elapsed: 0.001 s
% 10.55/2.08 % (2549115)Peak memory usage: 89 MB
% 10.55/2.08 % (2549109)Instruction limit reached!
% 10.55/2.08 % (2549109)------------------------------
% 10.55/2.08 % (2549109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549109)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549109)Termination reason: Instruction limit
% 10.55/2.08 % (2549109)Termination phase: Saturation
% 10.55/2.08 % (2549109)Time elapsed: 0.279 s
% 10.55/2.08 % (2549109)Peak memory usage: 100 MB
% 10.55/2.08 % (2549109)Instructions burned: 908 (million)
% 10.55/2.08 % (2549117)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=1563826843:st=8:i=592:sd=3:ep=RST:ss=axioms_2990 on theBenchmark for (2990ds/592Mi)
% 10.55/2.08 % (2549117)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549117)------------------------------
% 10.55/2.08 % (2549117)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549117)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549117)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549117)Time elapsed: 0.001 s
% 10.55/2.08 % (2549117)Peak memory usage: 88 MB
% 10.55/2.08 % (2549115)------------------------------
% 10.55/2.08 % (2549115)------------------------------
% 10.55/2.08 % (2549119)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=2368440848:st=3:i=13193:sd=3:ss=axioms_2989 on theBenchmark for (2989ds/13193Mi)
% 10.55/2.08 % (2549117)------------------------------
% 10.55/2.08 % (2549117)------------------------------
% 10.55/2.08 % (2549121)lrs+1666_7_slsqr=4,1:sil=8000:plsq=on:plsqc=1:sos=on:urr=on:plsql=on:rp=on:alpa=false:sac=on:slsq=on:random_seed=210985368:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2988 on theBenchmark for (2988ds/125Mi)
% 10.55/2.08 % (2549121)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549121)------------------------------
% 10.55/2.08 % (2549121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549121)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549121)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549121)Time elapsed: 0.001 s
% 10.55/2.08 % (2549121)Peak memory usage: 88 MB
% 10.55/2.08 % (2549121)Instructions burned: 1 (million)
% 10.55/2.08 % (2549124)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=156625248:i=134:gtgl=5:slsql=off:gtg=exists_sym_2987 on theBenchmark for (2987ds/134Mi)
% 10.55/2.08 % (2549124)Instruction limit reached!
% 10.55/2.08 % (2549124)------------------------------
% 10.55/2.08 % (2549124)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549124)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549124)Termination reason: Instruction limit
% 10.55/2.08 % (2549124)Termination phase: Saturation
% 10.55/2.08 % (2549124)Time elapsed: 0.047 s
% 10.55/2.08 % (2549124)Peak memory usage: 90 MB
% 10.55/2.08 % (2549124)Instructions burned: 135 (million)
% 10.55/2.08 % (2549121)------------------------------
% 10.55/2.08 % (2549121)------------------------------
% 10.55/2.08 % (2549101)Instruction limit reached!
% 10.55/2.08 % (2549101)------------------------------
% 10.55/2.08 % (2549101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549101)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549101)Termination reason: Instruction limit
% 10.55/2.08 % (2549101)Termination phase: Saturation
% 10.55/2.08 % (2549101)Time elapsed: 0.850 s
% 10.55/2.08 % (2549101)Peak memory usage: 141 MB
% 10.55/2.08 % (2549101)Instructions burned: 2350 (million)
% 10.55/2.08 % (2549077)First to succeed.
% 10.55/2.08 % (2549077)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2549072"
% 10.55/2.08 % (2549126)lrs+10_1_sil=16000:plsq=on:plsqc=1:plsqr=32,1:sos=on:lcm=reverse:fd=off:newcnf=on:random_seed=188875610:i=141:sd=1:gsp=on:sup=off:ss=axioms:sgt=8_2986 on theBenchmark for (2986ds/141Mi)
% 10.55/2.08 % (2549126)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549126)------------------------------
% 10.55/2.08 % (2549126)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549126)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549126)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549126)Time elapsed: 0.0000 s
% 10.55/2.08 % (2549126)Peak memory usage: 87 MB
% 10.55/2.08 % (2549119)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549119)------------------------------
% 10.55/2.08 % (2549119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549119)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549119)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549119)Time elapsed: 0.322 s
% 10.55/2.08 % (2549119)Peak memory usage: 127 MB
% 10.55/2.08 % (2549119)Instructions burned: 856 (million)
% 10.55/2.08 % (2549127)lrs+1011_1_sil=8000:plsq=on:sp=occurrence:fs=off:random_seed=3660482534:i=431:sd=1:fsr=off:sup=off:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/431Mi)
% 10.55/2.08 % (2549127)Refutation not found, incomplete strategy
% 10.55/2.08 % (2549127)------------------------------
% 10.55/2.08 % (2549127)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.55/2.08 % (2549127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.55/2.08 % (2549127)CaDiCaL version: 2.1.3
% 10.55/2.08 % (2549127)Termination reason: Refutation not found, incomplete strategy
% 10.55/2.08 % (2549127)Time elapsed: 0.0000 s
% 10.55/2.08 % (2549127)Peak memory usage: 87 MB
% 10.55/2.08 % (2549128)lrs+1010_1_ncem=casc2026/models/loop6.pt:sil=64000:tgt=full:npcc=on:prc=on:urr=ec_only:bsr=on:fd=preordered:gs=on:sac=on:newcnf=on:random_seed=572309138:i=6060:aac=none:ins=25_2986 on theBenchmark for (2986ds/6060Mi)
% 10.55/2.08 % (2549077)Refutation found. Thanks to Tanya!
% 10.55/2.08 % SZS status Theorem for theBenchmark
% 10.55/2.08 % SZS output start Proof for theBenchmark
% See solution above
% 11.13/2.18 % (2549077)------------------------------
% 11.13/2.18 % (2549077)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.13/2.18 % (2549077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.13/2.18 % (2549077)CaDiCaL version: 2.1.3
% 11.13/2.18 % (2549077)Termination reason: Refutation
% 11.13/2.18 % (2549077)Time elapsed: 1.282 s
% 11.13/2.18 % (2549077)Peak memory usage: 151 MB
% 11.13/2.18 % (2549077)Instructions burned: 3654 (million)
% 11.13/2.18 % (2549077)------------------------------
% 11.13/2.18 % (2549077)------------------------------
% 11.13/2.18 % (2549072)Success in time 1.56 s
% 11.13/2.18 % Vampire exiting
%------------------------------------------------------------------------------