%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL541+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:58:54 AM UTC 2026
% Result : Theorem 45.36s 6.89s
% Output : Refutation 45.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 28
% Syntax : Number of formulae : 144 ( 67 unt; 0 def)
% Number of atoms : 243 ( 31 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 169 ( 70 ~; 66 |; 2 &)
% ( 11 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 221 ( 219 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_equivalence_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',necessitation) ).
fof(f63,axiom,
( axiom_m1
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_m1) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+3.ax',km4b_necessitation) ).
fof(f84,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_or) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f89,conjecture,
axiom_m1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f90,negated_conjecture,
~ axiom_m1,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m1,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
=> axiom_m1 ),
inference(unused_predicate_definition_removal,[],[f63]) ).
fof(f97,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f98,plain,
( equivalence_3
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f104,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f105,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f107,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f108,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f109,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f110,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f111,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f112,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f117,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f112]) ).
fof(f118,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f117]) ).
fof(f119,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f111]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f110]) ).
fof(f121,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f109]) ).
fof(f122,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f108]) ).
fof(f123,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f107]) ).
fof(f125,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f105]) ).
fof(f126,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f104]) ).
fof(f132,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(ennf_transformation,[],[f98]) ).
fof(f133,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f134,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f136,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f97]) ).
fof(f141,plain,
( axiom_m1
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(ennf_transformation,[],[f92]) ).
fof(f143,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f145,plain,
( axiom_m1
| ~ is_a_theorem(strict_implies(and(sK0,sK1),and(sK1,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f141]) ).
fof(f146,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f118]) ).
fof(f147,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f119]) ).
fof(f148,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f120]) ).
fof(f149,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f121]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f122]) ).
fof(f151,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f123]) ).
fof(f153,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f154,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f126]) ).
fof(f160,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f132]) ).
fof(f161,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f133]) ).
fof(f162,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f134]) ).
fof(f165,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f167,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f168,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f169,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f170,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f171,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f173,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f174,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f180,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f181,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f182,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f136]) ).
fof(f187,plain,
( axiom_m1
| ~ is_a_theorem(strict_implies(and(sK0,sK1),and(sK1,sK0))) ),
inference(cnf_transformation,[],[f145]) ).
fof(f189,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f143]) ).
fof(f192,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f198,plain,
op_or,
inference(cnf_transformation,[],[f84]) ).
fof(f199,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f202,plain,
~ axiom_m1,
inference(cnf_transformation,[],[f91]) ).
fof(f204,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f189,f199]) ).
fof(f206,plain,
~ is_a_theorem(strict_implies(and(sK0,sK1),and(sK1,sK0))),
inference(forward_subsumption_resolution,[],[f187,f202]) ).
fof(f211,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f182,f192]) ).
fof(f213,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f162,f165]) ).
fof(f214,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f161,f198]) ).
fof(f215,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(forward_subsumption_resolution,[],[f160,f180]) ).
fof(f221,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f154,f174]) ).
fof(f222,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f153,f173]) ).
fof(f224,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f151,f171]) ).
fof(f225,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f226,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f149,f169]) ).
fof(f227,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f148,f168]) ).
fof(f228,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f147,f181]) ).
fof(f229,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f146,f167]) ).
fof(f231,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f214,f213]) ).
fof(f234,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f211,f204]) ).
fof(f239,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f229,f226]) ).
fof(f240,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f229,f221]) ).
fof(f263,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))),
inference(superposition,[],[f213,f213]) ).
fof(f264,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f231,f213]) ).
fof(f267,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f225,f229]) ).
fof(f272,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f227,f229]) ).
fof(f274,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),not(X2)),implies(X2,and(X0,not(X1))))),
inference(superposition,[],[f227,f213]) ).
fof(f282,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(forward_demodulation,[],[f272,f231]) ).
fof(f300,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f215,f229]) ).
fof(f308,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f224,f229]) ).
fof(f500,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f267,f226]) ).
fof(f501,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[],[f267,f221]) ).
fof(f505,plain,
! [X0] : is_a_theorem(implies(implies(X0,X0),implies(X0,X0))),
inference(resolution,[],[f267,f224]) ).
fof(f625,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),not(X2)))
| is_a_theorem(implies(X2,and(X0,not(X1)))) ),
inference(superposition,[],[f282,f264]) ).
fof(f693,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(resolution,[],[f300,f229]) ).
fof(f700,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f308,f267]) ).
fof(f721,plain,
! [X2,X0,X1] : implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1))),
inference(superposition,[],[f263,f231]) ).
fof(f866,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),implies(X2,and(not(X0),not(X1))))),
inference(superposition,[],[f274,f231]) ).
fof(f878,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),not(and(X2,or(X0,X1))))),
inference(forward_demodulation,[],[f866,f721]) ).
fof(f1767,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(and(X0,X1),X1))
| is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f693,f240]) ).
fof(f1768,plain,
! [X0] :
( ~ is_a_theorem(implies(and(X0,X0),X0))
| is_a_theorem(equiv(and(X0,X0),X0)) ),
inference(resolution,[],[f693,f501]) ).
fof(f1838,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f1768,f222]) ).
fof(f1839,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f1767,f222]) ).
fof(f1843,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f1838,f228]) ).
fof(f1851,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f700,f239]) ).
fof(f1871,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f213,f1843]) ).
fof(f1895,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f1871,f231]) ).
fof(f3332,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| and(X0,X1) = X1 ),
inference(resolution,[],[f1839,f228]) ).
fof(f3384,plain,
! [X0,X1] : and(implies(X0,X0),X1) = X1,
inference(resolution,[],[f3332,f500]) ).
fof(f3641,plain,
! [X0,X1] : not(not(X0)) = implies(implies(X1,X1),X0),
inference(superposition,[],[f213,f3384]) ).
fof(f4131,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X0,or(X1,X2)),and(or(X1,X2),not(not(X0))))),
inference(resolution,[],[f878,f625]) ).
fof(f5713,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,implies(X0,X1)))
| is_a_theorem(equiv(X1,implies(X0,X1))) ),
inference(resolution,[],[f1851,f693]) ).
fof(f5728,plain,
! [X0,X1] :
( is_a_theorem(equiv(X1,implies(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f5713,f226]) ).
fof(f5948,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X0,X1) = X1 ),
inference(resolution,[],[f5728,f228]) ).
fof(f6139,plain,
! [X0,X1] : implies(implies(implies(X0,X0),implies(X0,X0)),X1) = X1,
inference(resolution,[],[f5948,f505]) ).
fof(f6385,plain,
! [X1] : not(not(X1)) = X1,
inference(forward_demodulation,[],[f6139,f3641]) ).
fof(f6585,plain,
! [X2,X0,X1] : not(and(X1,or(X2,not(X0)))) = implies(X1,and(not(X2),X0)),
inference(superposition,[],[f721,f6385]) ).
fof(f75493,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),not(not(X1))))),
inference(superposition,[],[f4131,f1895]) ).
fof(f75534,plain,
! [X0,X1] : is_a_theorem(not(and(and(X1,not(not(X0))),or(not(X0),not(X1))))),
inference(forward_demodulation,[],[f75493,f721]) ).
fof(f75580,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),X1))),
inference(forward_demodulation,[],[f75534,f6585]) ).
fof(f75600,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),and(X0,X1))),
inference(forward_demodulation,[],[f75580,f6385]) ).
fof(f75616,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(resolution,[],[f75600,f234]) ).
fof(f92937,plain,
$false,
inference(resolution,[],[f75616,f206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL541+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 15:57:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.83/3.25 % (3135325)Will run a generic schedule for satisfiability detection.
% 19.83/3.25 % (3135331)% WARNING: option uhcvi not known.
% 19.83/3.25 % (3135334)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1068812035:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 19.83/3.25 % (3135336)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3777068823:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 19.83/3.25 % (3135330)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2126375547_2999 on theBenchmark for (2999ds/0Mi)
% 19.83/3.25 % (3135333)dis+10_1_sil=32000:sp=arity:random_seed=2506302547:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 19.83/3.25 % (3135332)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3145354170:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 19.83/3.25 % (3135335)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3072501669:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 19.83/3.25 % (3135331)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=57854651:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 19.83/3.25 % TRYING [1]
% 19.83/3.25 % TRYING [2]
% 19.83/3.25 % TRYING [3]
% 19.83/3.25 % TRYING [4]
% 19.83/3.25 % (3135333)Instruction limit reached!
% 19.83/3.25 % (3135333)------------------------------
% 19.83/3.25 % (3135333)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.83/3.25 % (3135333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.83/3.25 % (3135333)CaDiCaL version: 2.1.3
% 19.83/3.25 % (3135333)Termination reason: Instruction limit
% 19.83/3.25 % (3135333)Termination phase: Saturation
% 19.83/3.25 % (3135333)Time elapsed: 0.068 s
% 19.83/3.25 % (3135333)Peak memory usage: 13 MB
% 19.83/3.25 % (3135333)Instructions burned: 103 (million)
% 19.83/3.25 % (3135334)Instruction limit reached!
% 19.83/3.25 % (3135334)------------------------------
% 19.83/3.25 % (3135334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.83/3.25 % (3135334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.83/3.25 % (3135334)CaDiCaL version: 2.1.3
% 19.83/3.25 % (3135334)Termination reason: Instruction limit
% 19.83/3.25 % (3135334)Termination phase: Saturation
% 19.83/3.25 % (3135334)Time elapsed: 0.074 s
% 19.83/3.25 % (3135334)Peak memory usage: 13 MB
% 19.83/3.25 % (3135334)Instructions burned: 116 (million)
% 19.83/3.25 % (3135335)Instruction limit reached!
% 19.83/3.25 % (3135335)------------------------------
% 19.83/3.25 % (3135335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.83/3.25 % (3135335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.83/3.25 % (3135335)CaDiCaL version: 2.1.3
% 19.83/3.25 % (3135335)Termination reason: Instruction limit
% 19.83/3.25 % (3135335)Termination phase: Saturation
% 19.83/3.25 % (3135335)Time elapsed: 0.087 s
% 19.83/3.25 % (3135335)Peak memory usage: 14 MB
% 19.83/3.25 % (3135335)Instructions burned: 131 (million)
% 19.83/3.25 % (3135344)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=998847754:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 19.83/3.25 % TRYING [1]
% 19.83/3.25 % TRYING [2]
% 19.83/3.25 % (3135345)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3271582504:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 19.83/3.25 % TRYING [3]
% 19.83/3.25 % (3135346)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3889671464:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 19.83/3.25 % TRYING [4]
% 19.83/3.25 % (3135336)Instruction limit reached!
% 19.83/3.25 % (3135336)------------------------------
% 19.83/3.25 % (3135336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.83/3.25 % (3135336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.83/3.25 % (3135336)CaDiCaL version: 2.1.3
% 19.83/3.25 % (3135336)Termination reason: Instruction limit
% 19.83/3.25 % (3135336)Termination phase: Saturation
% 19.83/3.25 % (3135336)Time elapsed: 0.110 s
% 19.83/3.25 % (3135336)Peak memory usage: 14 MB
% 19.83/3.25 % (3135336)Instructions burned: 160 (million)
% 19.83/3.25 % TRYING [5]
% 19.83/3.25 % (3135350)ott-21_1_sil=16000:fs=off:random_seed=1680153417:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 19.83/3.25 % (3135345)Instruction limit reached!
% 19.83/3.25 % (3135345)------------------------------
% 19.83/3.25 % (3135345)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135345)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135345)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135345)Termination reason: Instruction limit
% 45.36/6.89 % (3135345)Termination phase: Saturation
% 45.36/6.89 % (3135345)Time elapsed: 0.094 s
% 45.36/6.89 % (3135345)Peak memory usage: 14 MB
% 45.36/6.89 % (3135345)Instructions burned: 132 (million)
% 45.36/6.89 % (3135352)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3285608788:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 45.36/6.89 % TRYING [5]
% 45.36/6.89 % (3135350)Instruction limit reached!
% 45.36/6.89 % (3135350)------------------------------
% 45.36/6.89 % (3135350)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135350)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135350)Termination reason: Instruction limit
% 45.36/6.89 % (3135350)Termination phase: Saturation
% 45.36/6.89 % (3135350)Time elapsed: 0.095 s
% 45.36/6.89 % (3135350)Peak memory usage: 13 MB
% 45.36/6.89 % (3135350)Instructions burned: 181 (million)
% 45.36/6.89 % (3135354)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3768291292:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 45.36/6.89 % TRYING [1]
% 45.36/6.89 % TRYING [2]
% 45.36/6.89 % TRYING [3]
% 45.36/6.89 % TRYING [4]
% 45.36/6.89 % (3135344)Instruction limit reached!
% 45.36/6.89 % (3135344)------------------------------
% 45.36/6.89 % (3135344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135344)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135344)Termination reason: Instruction limit
% 45.36/6.89 % (3135344)Termination phase: Finite model building SAT solving
% 45.36/6.89 % (3135344)Time elapsed: 0.394 s
% 45.36/6.89 % (3135344)Peak memory usage: 25 MB
% 45.36/6.89 % (3135344)Instructions burned: 715 (million)
% 45.36/6.89 % (3135356)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1926516708:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 45.36/6.89 % (3135346)Instruction limit reached!
% 45.36/6.89 % (3135346)------------------------------
% 45.36/6.89 % (3135346)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135346)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135346)Termination reason: Instruction limit
% 45.36/6.89 % (3135346)Termination phase: Saturation
% 45.36/6.89 % (3135346)Time elapsed: 0.406 s
% 45.36/6.89 % (3135346)Peak memory usage: 20 MB
% 45.36/6.89 % (3135346)Instructions burned: 685 (million)
% 45.36/6.89 % (3135352)Instruction limit reached!
% 45.36/6.89 % (3135352)------------------------------
% 45.36/6.89 % (3135352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135352)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135352)Termination reason: Instruction limit
% 45.36/6.89 % (3135352)Termination phase: Saturation
% 45.36/6.89 % (3135352)Time elapsed: 0.316 s
% 45.36/6.89 % (3135352)Peak memory usage: 14 MB
% 45.36/6.89 % (3135352)Instructions burned: 477 (million)
% 45.36/6.89 % (3135358)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1432991584:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 45.36/6.89 % (3135359)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3408607288:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 45.36/6.89 % (3135354)Instruction limit reached!
% 45.36/6.89 % (3135354)------------------------------
% 45.36/6.89 % (3135354)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135354)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135354)Termination reason: Instruction limit
% 45.36/6.89 % (3135354)Termination phase: Finite model building SAT solving
% 45.36/6.89 % (3135354)Time elapsed: 0.332 s
% 45.36/6.89 % (3135354)Peak memory usage: 21 MB
% 45.36/6.89 % (3135354)Instructions burned: 868 (million)
% 45.36/6.89 % (3135362)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1265251467:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 45.36/6.89 % TRYING [14]
% 45.36/6.89 % (3135358)Instruction limit reached!
% 45.36/6.89 % (3135358)------------------------------
% 45.36/6.89 % (3135358)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135358)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135358)Termination reason: Instruction limit
% 45.36/6.89 % (3135358)Termination phase: Finite model building constraint generation
% 45.36/6.89 % (3135358)Time elapsed: 0.317 s
% 45.36/6.89 % (3135358)Peak memory usage: 69 MB
% 45.36/6.89 % (3135358)Instructions burned: 891 (million)
% 45.36/6.89 % (3135364)fmb+10_1_sil=64000:random_seed=4037546773:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 45.36/6.89 % TRYING [1]
% 45.36/6.89 % TRYING [2]
% 45.36/6.89 % TRYING [3]
% 45.36/6.89 % TRYING [4]
% 45.36/6.89 % (3135359)Instruction limit reached!
% 45.36/6.89 % (3135359)------------------------------
% 45.36/6.89 % (3135359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135359)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135359)Termination reason: Instruction limit
% 45.36/6.89 % (3135359)Termination phase: Saturation
% 45.36/6.89 % (3135359)Time elapsed: 0.456 s
% 45.36/6.89 % (3135359)Peak memory usage: 21 MB
% 45.36/6.89 % (3135359)Instructions burned: 692 (million)
% 45.36/6.89 % TRYING [5]
% 45.36/6.89 % (3135366)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=743989559:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 45.36/6.89 % TRYING [20]
% 45.36/6.89 % (3135362)Instruction limit reached!
% 45.36/6.89 % (3135362)------------------------------
% 45.36/6.89 % (3135362)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135362)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135362)Termination reason: Instruction limit
% 45.36/6.89 % (3135362)Termination phase: Saturation
% 45.36/6.89 % (3135362)Time elapsed: 0.526 s
% 45.36/6.89 % (3135362)Peak memory usage: 25 MB
% 45.36/6.89 % (3135362)Instructions burned: 879 (million)
% 45.36/6.89 % (3135368)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=745952735:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 45.36/6.89 % TRYING [8]
% 45.36/6.89 % (3135356)Instruction limit reached!
% 45.36/6.89 % (3135356)------------------------------
% 45.36/6.89 % (3135356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135356)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135356)Termination reason: Instruction limit
% 45.36/6.89 % (3135356)Termination phase: Saturation
% 45.36/6.89 % (3135356)Time elapsed: 0.735 s
% 45.36/6.89 % (3135356)Peak memory usage: 22 MB
% 45.36/6.89 % (3135356)Instructions burned: 1180 (million)
% 45.36/6.89 % (3135370)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2429870257:i=5131_2987 on theBenchmark for (2987ds/5131Mi)
% 45.36/6.89 % TRYING [6]
% 45.36/6.89 % TRYING [6]
% 45.36/6.89 % (3135368)Instruction limit reached!
% 45.36/6.89 % (3135368)------------------------------
% 45.36/6.89 % (3135368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135368)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135368)Termination reason: Instruction limit
% 45.36/6.89 % (3135368)Termination phase: Finite model building constraint generation
% 45.36/6.89 % (3135368)Time elapsed: 0.346 s
% 45.36/6.89 % (3135368)Peak memory usage: 65 MB
% 45.36/6.89 % (3135368)Instructions burned: 922 (million)
% 45.36/6.89 % (3135372)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2697847960:i=1472:ins=7:fdi=8:gsp=on_2984 on theBenchmark for (2984ds/1472Mi)
% 45.36/6.89 % (3135372)Instruction limit reached!
% 45.36/6.89 % (3135372)------------------------------
% 45.36/6.89 % (3135372)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135372)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135372)Termination reason: Instruction limit
% 45.36/6.89 % (3135372)Termination phase: Saturation
% 45.36/6.89 % (3135372)Time elapsed: 0.730 s
% 45.36/6.89 % (3135372)Peak memory usage: 28 MB
% 45.36/6.89 % (3135372)Instructions burned: 1474 (million)
% 45.36/6.89 % (3135374)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=57614940:i=6324_2977 on theBenchmark for (2977ds/6324Mi)
% 45.36/6.89 % TRYING [77]
% 45.36/6.89 % TRYING [7]
% 45.36/6.89 % TRYING [7]
% 45.36/6.89 % (3135370)Instruction limit reached!
% 45.36/6.89 % (3135370)------------------------------
% 45.36/6.89 % (3135370)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135370)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135370)Termination reason: Instruction limit
% 45.36/6.89 % (3135370)Termination phase: Saturation
% 45.36/6.89 % (3135370)Time elapsed: 2.860 s
% 45.36/6.89 % (3135370)Peak memory usage: 63 MB
% 45.36/6.89 % (3135370)Instructions burned: 5132 (million)
% 45.36/6.89 % (3135377)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2179539945:fmbsr=2.30978:i=2174_2958 on theBenchmark for (2958ds/2174Mi)
% 45.36/6.89 % TRYING [16]
% 45.36/6.89 % (3135366)Instruction limit reached!
% 45.36/6.89 % (3135366)------------------------------
% 45.36/6.89 % (3135366)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135366)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135366)Termination reason: Instruction limit
% 45.36/6.89 % (3135366)Termination phase: Finite model building constraint generation
% 45.36/6.89 % (3135366)Time elapsed: 3.286 s
% 45.36/6.89 % (3135366)Peak memory usage: 538 MB
% 45.36/6.89 % (3135366)Instructions burned: 9515 (million)
% 45.36/6.89 % (3135379)ott-2_1_sil=16000:newcnf=on:random_seed=2155042023:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2955 on theBenchmark for (2955ds/869Mi)
% 45.36/6.89 % (3135374)Instruction limit reached!
% 45.36/6.89 % (3135374)------------------------------
% 45.36/6.89 % (3135374)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135374)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135374)Termination reason: Instruction limit
% 45.36/6.89 % (3135374)Termination phase: Finite model building constraint generation
% 45.36/6.89 % (3135374)Time elapsed: 2.311 s
% 45.36/6.89 % (3135374)Peak memory usage: 415 MB
% 45.36/6.89 % (3135374)Instructions burned: 6324 (million)
% 45.36/6.89 % (3135381)ott+10_1_sil=32000:tgt=ground:random_seed=1230865159:i=5114:av=off_2953 on theBenchmark for (2953ds/5114Mi)
% 45.36/6.89 % (3135377)Instruction limit reached!
% 45.36/6.89 % (3135377)------------------------------
% 45.36/6.89 % (3135377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135377)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135377)Termination reason: Instruction limit
% 45.36/6.89 % (3135377)Termination phase: Finite model building constraint generation
% 45.36/6.89 % (3135377)Time elapsed: 0.734 s
% 45.36/6.89 % (3135377)Peak memory usage: 132 MB
% 45.36/6.89 % (3135377)Instructions burned: 2177 (million)
% 45.36/6.89 % (3135383)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=4044794054:i=54282_2950 on theBenchmark for (2950ds/54282Mi)
% 45.36/6.89 % TRYING [1]
% 45.36/6.89 % TRYING [2]
% 45.36/6.89 % TRYING [3]
% 45.36/6.89 % TRYING [4]
% 45.36/6.89 % (3135379)Instruction limit reached!
% 45.36/6.89 % (3135379)------------------------------
% 45.36/6.89 % (3135379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135379)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135379)Termination reason: Instruction limit
% 45.36/6.89 % (3135379)Termination phase: Saturation
% 45.36/6.89 % (3135379)Time elapsed: 0.561 s
% 45.36/6.89 % (3135379)Peak memory usage: 19 MB
% 45.36/6.89 % (3135379)Instructions burned: 869 (million)
% 45.36/6.89 % (3135385)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=3282744236:i=3512:aac=none_2950 on theBenchmark for (2950ds/3512Mi)
% 45.36/6.89 % TRYING [5]
% 45.36/6.89 % TRYING [8]
% 45.36/6.89 % TRYING [6]
% 45.36/6.89 % TRYING [8]
% 45.36/6.89 % (3135381) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3135325-3135381"...
% 45.36/6.89 % (3135381)...printing done.
% 45.36/6.89 % (3135381)Refutation found. Thanks to Tanya!
% 45.36/6.89 % SZS status Theorem for theBenchmark
% 45.36/6.89 % SZS output start Proof for theBenchmark
% See solution above
% 45.36/6.89 % (3135381)------------------------------
% 45.36/6.89 % (3135381)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 45.36/6.89 % (3135381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 45.36/6.89 % (3135381)CaDiCaL version: 2.1.3
% 45.36/6.89 % (3135381)Termination reason: Refutation
% 45.36/6.89 % (3135381)Time elapsed: 1.766 s
% 45.36/6.89 % (3135381)Peak memory usage: 40 MB
% 45.36/6.89 % (3135381)Instructions burned: 2797 (million)
% 45.36/6.89 % (3135325)Success in time 6.486 s
% 45.36/6.89 % Vampire exiting
%------------------------------------------------------------------------------