%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL528+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 : n018.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:52 AM UTC 2026
% Result : Theorem 41.84s 6.36s
% Output : Refutation 41.84s
% 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+2.ax',km5_necessitation) ).
fof(f83,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_or) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f89,negated_conjecture,
~ axiom_m1,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ axiom_m1,
inference(flattening,[],[f89]) ).
fof(f91,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
=> axiom_m1 ),
inference(unused_predicate_definition_removal,[],[f63]) ).
fof(f95,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f96,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(f102,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f103,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f105,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(f106,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f107,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f108,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f109,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f110,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(f115,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f110]) ).
fof(f116,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f109]) ).
fof(f118,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f108]) ).
fof(f119,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f107]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f106]) ).
fof(f121,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f105]) ).
fof(f123,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f103]) ).
fof(f124,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f102]) ).
fof(f130,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(ennf_transformation,[],[f96]) ).
fof(f131,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f132,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f134,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f95]) ).
fof(f138,plain,
( axiom_m1
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(ennf_transformation,[],[f91]) ).
fof(f140,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f142,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)],[f138]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f116]) ).
fof(f144,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f117]) ).
fof(f145,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f118]) ).
fof(f146,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f147,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f120]) ).
fof(f148,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f121]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f123]) ).
fof(f151,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f157,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f158,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f131]) ).
fof(f159,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f132]) ).
fof(f162,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f164,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f165,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f166,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f167,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f168,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f170,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f171,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f177,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f178,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f179,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f134]) ).
fof(f183,plain,
( axiom_m1
| ~ is_a_theorem(strict_implies(and(sK0,sK1),and(sK1,sK0))) ),
inference(cnf_transformation,[],[f142]) ).
fof(f185,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f140]) ).
fof(f188,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f193,plain,
op_or,
inference(cnf_transformation,[],[f83]) ).
fof(f194,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
~ axiom_m1,
inference(cnf_transformation,[],[f90]) ).
fof(f199,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f185,f194]) ).
fof(f201,plain,
~ is_a_theorem(strict_implies(and(sK0,sK1),and(sK1,sK0))),
inference(forward_subsumption_resolution,[],[f183,f197]) ).
fof(f205,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f179,f188]) ).
fof(f207,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f159,f162]) ).
fof(f208,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f158,f193]) ).
fof(f209,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(forward_subsumption_resolution,[],[f157,f177]) ).
fof(f215,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f151,f171]) ).
fof(f216,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f218,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f148,f168]) ).
fof(f219,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f147,f167]) ).
fof(f220,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f146,f166]) ).
fof(f221,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f145,f165]) ).
fof(f222,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f144,f178]) ).
fof(f223,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f143,f164]) ).
fof(f225,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f208,f207]) ).
fof(f227,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f205,f199]) ).
fof(f231,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f223,f220]) ).
fof(f232,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f223,f215]) ).
fof(f253,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))),
inference(superposition,[],[f207,f207]) ).
fof(f254,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f225,f207]) ).
fof(f257,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f219,f223]) ).
fof(f264,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f221,f223]) ).
fof(f266,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),not(X2)),implies(X2,and(X0,not(X1))))),
inference(superposition,[],[f221,f207]) ).
fof(f274,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(forward_demodulation,[],[f264,f225]) ).
fof(f299,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f209,f223]) ).
fof(f306,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f218,f223]) ).
fof(f481,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f257,f220]) ).
fof(f482,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[],[f257,f215]) ).
fof(f486,plain,
! [X0] : is_a_theorem(implies(implies(X0,X0),implies(X0,X0))),
inference(resolution,[],[f257,f218]) ).
fof(f605,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),not(X2)))
| is_a_theorem(implies(X2,and(X0,not(X1)))) ),
inference(superposition,[],[f274,f254]) ).
fof(f671,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(resolution,[],[f299,f223]) ).
fof(f675,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f306,f257]) ).
fof(f698,plain,
! [X2,X0,X1] : implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1))),
inference(superposition,[],[f253,f225]) ).
fof(f841,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),implies(X2,and(not(X0),not(X1))))),
inference(superposition,[],[f266,f225]) ).
fof(f853,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),not(and(X2,or(X0,X1))))),
inference(forward_demodulation,[],[f841,f698]) ).
fof(f1651,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,[],[f671,f232]) ).
fof(f1652,plain,
! [X0] :
( ~ is_a_theorem(implies(and(X0,X0),X0))
| is_a_theorem(equiv(and(X0,X0),X0)) ),
inference(resolution,[],[f671,f482]) ).
fof(f1717,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f1652,f216]) ).
fof(f1718,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f1651,f216]) ).
fof(f1722,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f1717,f222]) ).
fof(f1730,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f675,f231]) ).
fof(f1755,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f207,f1722]) ).
fof(f1777,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f1755,f225]) ).
fof(f2509,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| and(X0,X1) = X1 ),
inference(resolution,[],[f1718,f222]) ).
fof(f2539,plain,
! [X0,X1] : and(implies(X0,X0),X1) = X1,
inference(resolution,[],[f2509,f481]) ).
fof(f2769,plain,
! [X0,X1] : not(not(X0)) = implies(implies(X1,X1),X0),
inference(superposition,[],[f207,f2539]) ).
fof(f4330,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X0,or(X1,X2)),and(or(X1,X2),not(not(X0))))),
inference(resolution,[],[f853,f605]) ).
fof(f5354,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,[],[f1730,f671]) ).
fof(f5368,plain,
! [X0,X1] :
( is_a_theorem(equiv(X1,implies(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f5354,f220]) ).
fof(f5572,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X0,X1) = X1 ),
inference(resolution,[],[f5368,f222]) ).
fof(f5658,plain,
! [X0,X1] : implies(implies(implies(X0,X0),implies(X0,X0)),X1) = X1,
inference(resolution,[],[f5572,f486]) ).
fof(f5872,plain,
! [X1] : not(not(X1)) = X1,
inference(forward_demodulation,[],[f5658,f2769]) ).
fof(f6083,plain,
! [X2,X0,X1] : not(and(X1,or(X2,not(X0)))) = implies(X1,and(not(X2),X0)),
inference(superposition,[],[f698,f5872]) ).
fof(f75616,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),not(not(X1))))),
inference(superposition,[],[f4330,f1777]) ).
fof(f75653,plain,
! [X0,X1] : is_a_theorem(not(and(and(X1,not(not(X0))),or(not(X0),not(X1))))),
inference(forward_demodulation,[],[f75616,f698]) ).
fof(f75700,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),X1))),
inference(forward_demodulation,[],[f75653,f6083]) ).
fof(f75719,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),and(X0,X1))),
inference(forward_demodulation,[],[f75700,f5872]) ).
fof(f75858,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(resolution,[],[f75719,f227]) ).
fof(f79334,plain,
$false,
inference(resolution,[],[f75858,f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL528+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.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 15:58:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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
% 21.27/3.40 % (2546237)Will run a generic schedule for satisfiability detection.
% 21.27/3.40 % (2546243)% WARNING: option uhcvi not known.
% 21.27/3.40 % (2546245)dis+10_1_sil=32000:sp=arity:random_seed=4146441716:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 21.27/3.40 % (2546242)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=272776713_2999 on theBenchmark for (2999ds/0Mi)
% 21.27/3.40 % (2546243)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1015707981:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 21.27/3.40 % (2546244)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1597283578:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 21.27/3.40 % (2546246)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=466658866:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 21.27/3.40 % (2546247)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2703720150:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 21.27/3.40 % (2546248)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=724380848:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 21.27/3.40 % TRYING [1]
% 21.27/3.40 % TRYING [2]
% 21.27/3.40 % TRYING [3]
% 21.27/3.40 % TRYING [4]
% 21.27/3.40 % (2546248)Instruction limit reached!
% 21.27/3.40 % (2546248)------------------------------
% 21.27/3.40 % (2546248)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.27/3.40 % (2546248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.27/3.40 % (2546248)CaDiCaL version: 2.1.3
% 21.27/3.40 % (2546248)Termination reason: Instruction limit
% 21.27/3.40 % (2546248)Termination phase: Saturation
% 21.27/3.40 % (2546248)Time elapsed: 0.062 s
% 21.27/3.40 % (2546248)Peak memory usage: 14 MB
% 21.27/3.40 % (2546248)Instructions burned: 160 (million)
% 21.27/3.40 % (2546245)Instruction limit reached!
% 21.27/3.40 % (2546245)------------------------------
% 21.27/3.40 % (2546245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.27/3.40 % (2546245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.27/3.40 % (2546245)CaDiCaL version: 2.1.3
% 21.27/3.40 % (2546245)Termination reason: Instruction limit
% 21.27/3.40 % (2546245)Termination phase: Saturation
% 21.27/3.40 % (2546245)Time elapsed: 0.068 s
% 21.27/3.40 % (2546245)Peak memory usage: 13 MB
% 21.27/3.40 % (2546245)Instructions burned: 104 (million)
% 21.27/3.40 % (2546256)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4196508923:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 21.27/3.40 % (2546246)Instruction limit reached!
% 21.27/3.40 % (2546246)------------------------------
% 21.27/3.40 % (2546246)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.27/3.40 % (2546246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.27/3.40 % (2546246)CaDiCaL version: 2.1.3
% 21.27/3.40 % (2546246)Termination reason: Instruction limit
% 21.27/3.40 % (2546246)Termination phase: Saturation
% 21.27/3.40 % (2546246)Time elapsed: 0.075 s
% 21.27/3.40 % (2546246)Peak memory usage: 13 MB
% 21.27/3.40 % (2546246)Instructions burned: 116 (million)
% 21.27/3.40 % TRYING [1]
% 21.27/3.40 % TRYING [2]
% 21.27/3.40 % TRYING [3]
% 21.27/3.40 % TRYING [4]
% 21.27/3.40 % (2546257)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=15738977:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 21.27/3.40 % (2546247)Instruction limit reached!
% 21.27/3.40 % (2546247)------------------------------
% 21.27/3.40 % (2546247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.27/3.40 % (2546247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.27/3.40 % (2546247)CaDiCaL version: 2.1.3
% 21.27/3.40 % (2546247)Termination reason: Instruction limit
% 21.27/3.40 % (2546247)Termination phase: Saturation
% 21.27/3.40 % (2546247)Time elapsed: 0.088 s
% 21.27/3.40 % (2546247)Peak memory usage: 14 MB
% 21.27/3.40 % (2546247)Instructions burned: 132 (million)
% 21.27/3.40 % (2546259)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=2748025320:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 21.27/3.40 % (2546261)ott-21_1_sil=16000:fs=off:random_seed=1217056965:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 21.27/3.40 % TRYING [5]
% 21.27/3.40 % TRYING [5]
% 21.27/3.40 % (2546257)Instruction limit reached!
% 21.27/3.40 % (2546257)------------------------------
% 21.27/3.40 % (2546257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546257)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546257)Termination reason: Instruction limit
% 41.84/6.36 % (2546257)Termination phase: Saturation
% 41.84/6.36 % (2546257)Time elapsed: 0.090 s
% 41.84/6.36 % (2546257)Peak memory usage: 14 MB
% 41.84/6.36 % (2546257)Instructions burned: 132 (million)
% 41.84/6.36 % (2546264)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3716382472:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 41.84/6.36 % (2546261)Instruction limit reached!
% 41.84/6.36 % (2546261)------------------------------
% 41.84/6.36 % (2546261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546261)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546261)Termination reason: Instruction limit
% 41.84/6.36 % (2546261)Termination phase: Saturation
% 41.84/6.36 % (2546261)Time elapsed: 0.097 s
% 41.84/6.36 % (2546261)Peak memory usage: 13 MB
% 41.84/6.36 % (2546261)Instructions burned: 180 (million)
% 41.84/6.36 % (2546266)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3827839061:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 41.84/6.36 % TRYING [1]
% 41.84/6.36 % TRYING [2]
% 41.84/6.36 % TRYING [3]
% 41.84/6.36 % (2546256)Instruction limit reached!
% 41.84/6.36 % (2546256)------------------------------
% 41.84/6.36 % (2546256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546256)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546256)Termination reason: Instruction limit
% 41.84/6.36 % (2546256)Termination phase: Finite model building SAT solving
% 41.84/6.36 % (2546256)Time elapsed: 0.207 s
% 41.84/6.36 % (2546256)Peak memory usage: 25 MB
% 41.84/6.36 % (2546256)Instructions burned: 715 (million)
% 41.84/6.36 % (2546268)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2169131250:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 41.84/6.36 % TRYING [4]
% 41.84/6.36 % (2546259)Instruction limit reached!
% 41.84/6.36 % (2546259)------------------------------
% 41.84/6.36 % (2546259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546259)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546259)Termination reason: Instruction limit
% 41.84/6.36 % (2546259)Termination phase: Saturation
% 41.84/6.36 % (2546259)Time elapsed: 0.409 s
% 41.84/6.36 % (2546259)Peak memory usage: 21 MB
% 41.84/6.36 % (2546259)Instructions burned: 684 (million)
% 41.84/6.36 % (2546264)Instruction limit reached!
% 41.84/6.36 % (2546264)------------------------------
% 41.84/6.36 % (2546264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546264)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546264)Termination reason: Instruction limit
% 41.84/6.36 % (2546264)Termination phase: Saturation
% 41.84/6.36 % (2546264)Time elapsed: 0.315 s
% 41.84/6.36 % (2546264)Peak memory usage: 14 MB
% 41.84/6.36 % (2546264)Instructions burned: 477 (million)
% 41.84/6.36 % (2546270)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2488882261:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 41.84/6.36 % (2546271)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=1805816447: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)
% 41.84/6.36 % (2546266)Instruction limit reached!
% 41.84/6.36 % (2546266)------------------------------
% 41.84/6.36 % (2546266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546266)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546266)Termination reason: Instruction limit
% 41.84/6.36 % (2546266)Termination phase: Finite model building SAT solving
% 41.84/6.36 % (2546266)Time elapsed: 0.334 s
% 41.84/6.36 % (2546266)Peak memory usage: 21 MB
% 41.84/6.36 % (2546266)Instructions burned: 867 (million)
% 41.84/6.36 % (2546274)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2925059380:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 41.84/6.36 % TRYING [14]
% 41.84/6.36 % (2546268)Instruction limit reached!
% 41.84/6.36 % (2546268)------------------------------
% 41.84/6.36 % (2546268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546268)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546268)Termination reason: Instruction limit
% 41.84/6.36 % (2546268)Termination phase: Saturation
% 41.84/6.36 % (2546268)Time elapsed: 0.397 s
% 41.84/6.36 % (2546268)Peak memory usage: 22 MB
% 41.84/6.36 % (2546268)Instructions burned: 1182 (million)
% 41.84/6.36 % (2546276)fmb+10_1_sil=64000:random_seed=950930455:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 41.84/6.36 % TRYING [1]
% 41.84/6.36 % TRYING [2]
% 41.84/6.36 % TRYING [3]
% 41.84/6.36 % TRYING [4]
% 41.84/6.36 % TRYING [5]
% 41.84/6.36 % (2546270)Instruction limit reached!
% 41.84/6.36 % (2546270)------------------------------
% 41.84/6.36 % (2546270)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546270)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546270)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546270)Termination reason: Instruction limit
% 41.84/6.36 % (2546270)Termination phase: Finite model building constraint generation
% 41.84/6.36 % (2546270)Time elapsed: 0.316 s
% 41.84/6.36 % (2546270)Peak memory usage: 69 MB
% 41.84/6.36 % (2546270)Instructions burned: 891 (million)
% 41.84/6.36 % (2546278)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2366650705:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 41.84/6.36 % TRYING [20]
% 41.84/6.36 % TRYING [6]
% 41.84/6.36 % (2546271)Instruction limit reached!
% 41.84/6.36 % (2546271)------------------------------
% 41.84/6.36 % (2546271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546271)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546271)Termination reason: Instruction limit
% 41.84/6.36 % (2546271)Termination phase: Saturation
% 41.84/6.36 % (2546271)Time elapsed: 0.435 s
% 41.84/6.36 % (2546271)Peak memory usage: 21 MB
% 41.84/6.36 % (2546271)Instructions burned: 693 (million)
% 41.84/6.36 % (2546280)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=307469399:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 41.84/6.36 % TRYING [8]
% 41.84/6.36 % (2546274)Instruction limit reached!
% 41.84/6.36 % (2546274)------------------------------
% 41.84/6.36 % (2546274)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546274)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546274)Termination reason: Instruction limit
% 41.84/6.36 % (2546274)Termination phase: Saturation
% 41.84/6.36 % (2546274)Time elapsed: 0.541 s
% 41.84/6.36 % (2546274)Peak memory usage: 23 MB
% 41.84/6.36 % (2546274)Instructions burned: 880 (million)
% 41.84/6.36 % (2546282)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1538570117:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 41.84/6.36 % TRYING [6]
% 41.84/6.36 % (2546280)Instruction limit reached!
% 41.84/6.36 % (2546280)------------------------------
% 41.84/6.36 % (2546280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546280)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546280)Termination reason: Instruction limit
% 41.84/6.36 % (2546280)Termination phase: Finite model building constraint generation
% 41.84/6.36 % (2546280)Time elapsed: 0.343 s
% 41.84/6.36 % (2546280)Peak memory usage: 66 MB
% 41.84/6.36 % (2546280)Instructions burned: 921 (million)
% 41.84/6.36 % (2546284)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3639527599:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 41.84/6.36 % TRYING [7]
% 41.84/6.36 % (2546284)Instruction limit reached!
% 41.84/6.36 % (2546284)------------------------------
% 41.84/6.36 % (2546284)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546284)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546284)Termination reason: Instruction limit
% 41.84/6.36 % (2546284)Termination phase: Saturation
% 41.84/6.36 % (2546284)Time elapsed: 0.645 s
% 41.84/6.36 % (2546284)Peak memory usage: 23 MB
% 41.84/6.36 % (2546284)Instructions burned: 1474 (million)
% 41.84/6.36 % (2546286)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2072169367:i=6324_2979 on theBenchmark for (2979ds/6324Mi)
% 41.84/6.36 % TRYING [77]
% 41.84/6.36 % TRYING [7]
% 41.84/6.36 % TRYING [8]
% 41.84/6.36 % (2546282)Instruction limit reached!
% 41.84/6.36 % (2546282)------------------------------
% 41.84/6.36 % (2546282)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546282)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546282)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546282)Termination reason: Instruction limit
% 41.84/6.36 % (2546282)Termination phase: Saturation
% 41.84/6.36 % (2546282)Time elapsed: 2.876 s
% 41.84/6.36 % (2546282)Peak memory usage: 63 MB
% 41.84/6.36 % (2546282)Instructions burned: 5132 (million)
% 41.84/6.36 % (2546288)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=832126734:fmbsr=2.30978:i=2174_2959 on theBenchmark for (2959ds/2174Mi)
% 41.84/6.36 % TRYING [16]
% 41.84/6.36 % (2546278)Instruction limit reached!
% 41.84/6.36 % (2546278)------------------------------
% 41.84/6.36 % (2546278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546278)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546278)Termination reason: Instruction limit
% 41.84/6.36 % (2546278)Termination phase: Finite model building constraint generation
% 41.84/6.36 % (2546278)Time elapsed: 3.312 s
% 41.84/6.36 % (2546278)Peak memory usage: 538 MB
% 41.84/6.36 % (2546278)Instructions burned: 9517 (million)
% 41.84/6.36 % (2546290)ott-2_1_sil=16000:newcnf=on:random_seed=3464804082:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2957 on theBenchmark for (2957ds/869Mi)
% 41.84/6.36 % (2546286)Instruction limit reached!
% 41.84/6.36 % (2546286)------------------------------
% 41.84/6.36 % (2546286)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546286)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546286)Termination reason: Instruction limit
% 41.84/6.36 % (2546286)Termination phase: Finite model building constraint generation
% 41.84/6.36 % (2546286)Time elapsed: 2.313 s
% 41.84/6.36 % (2546286)Peak memory usage: 415 MB
% 41.84/6.36 % (2546286)Instructions burned: 6324 (million)
% 41.84/6.36 % (2546292)ott+10_1_sil=32000:tgt=ground:random_seed=4115109937:i=5114:av=off_2955 on theBenchmark for (2955ds/5114Mi)
% 41.84/6.36 % (2546288)Instruction limit reached!
% 41.84/6.36 % (2546288)------------------------------
% 41.84/6.36 % (2546288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546288)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546288)Termination reason: Instruction limit
% 41.84/6.36 % (2546288)Termination phase: Finite model building constraint generation
% 41.84/6.36 % (2546288)Time elapsed: 0.738 s
% 41.84/6.36 % (2546288)Peak memory usage: 132 MB
% 41.84/6.36 % (2546288)Instructions burned: 2175 (million)
% 41.84/6.36 % (2546294)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=263222135:i=54282_2951 on theBenchmark for (2951ds/54282Mi)
% 41.84/6.36 % TRYING [1]
% 41.84/6.36 % TRYING [2]
% 41.84/6.36 % TRYING [3]
% 41.84/6.36 % (2546290)Instruction limit reached!
% 41.84/6.36 % (2546290)------------------------------
% 41.84/6.36 % (2546290)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.36 % (2546290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.36 % (2546290)CaDiCaL version: 2.1.3
% 41.84/6.36 % (2546290)Termination reason: Instruction limit
% 41.84/6.36 % (2546290)Termination phase: Saturation
% 41.84/6.36 % (2546290)Time elapsed: 0.569 s
% 41.84/6.36 % (2546290)Peak memory usage: 19 MB
% 41.84/6.36 % (2546290)Instructions burned: 870 (million)
% 41.84/6.36 % TRYING [4]
% 41.84/6.36 % (2546296)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2951664731:i=3512:aac=none_2951 on theBenchmark for (2951ds/3512Mi)
% 41.84/6.36 % TRYING [5]
% 41.84/6.36 % (2546292) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2546237-2546292"...
% 41.84/6.36 % (2546292)...printing done.
% 41.84/6.36 % (2546292)Refutation found. Thanks to Tanya!
% 41.84/6.36 % SZS status Theorem for theBenchmark
% 41.84/6.36 % SZS output start Proof for theBenchmark
% See solution above
% 41.84/6.37 % (2546292)------------------------------
% 41.84/6.37 % (2546292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 41.84/6.37 % (2546292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 41.84/6.37 % (2546292)CaDiCaL version: 2.1.3
% 41.84/6.37 % (2546292)Termination reason: Refutation
% 41.84/6.37 % (2546292)Time elapsed: 1.504 s
% 41.84/6.37 % (2546292)Peak memory usage: 37 MB
% 41.84/6.37 % (2546292)Instructions burned: 2385 (million)
% 41.84/6.37 % (2546237)Success in time 5.965 s
% 41.84/6.37 % Vampire exiting
%------------------------------------------------------------------------------