%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL300-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:51:54 AM UTC 2026
% Result : Unsatisfiable 9.76s 3.51s
% Output : Refutation 17.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 27
% Syntax : Number of formulae : 140 ( 76 unt; 16 def)
% Number of atoms : 224 ( 30 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 169 ( 85 ~; 81 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 15 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 122 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(not(not(p)),not(q))),or(p,not(q)))),not(or(not(or(p,not(q))),or(not(not(p)),not(q))))))),
inference(definition_unfolding,[],[f11,f12,f6]) ).
fof(f20,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
not(p) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(q),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(q) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = or(sF1,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
or(sF1,sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(p,sF2),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(p,sF2) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = or(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
or(sF4,sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = not(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
not(sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = not(sF5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
not(sF5) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = or(sF8,sF3),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF8,sF3) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = not(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF9) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF7,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF7,sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = not(sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
not(sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,plain,
~ theorem(sF12),
inference(definition_folding,[],[f19,f45,f43,f41,f39,f27,f25,f23,f21,f37,f31,f25,f35,f33,f31,f25,f29,f27,f25,f23,f21]) ).
fof(f47,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f17]) ).
fof(f50,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f51,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f90,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f18,f47]) ).
fof(f91,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f18,f51]) ).
fof(f97,plain,
! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0)
| ~ theorem(sF9) ),
inference(superposition,[],[f18,f41]) ).
fof(f99,definition,
( spl13_1
<=> theorem(sF9) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f101,plain,
( ~ theorem(sF9)
| spl13_1 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f103,definition,
( spl13_2
<=> ! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f104,plain,
( ! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f105,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f97,f103,f99]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f50,f18]) ).
fof(f167,plain,
theorem(or(not(sF11),or(sF10,sF7))),
inference(superposition,[],[f51,f43]) ).
fof(f169,plain,
theorem(or(sF12,or(sF10,sF7))),
inference(forward_demodulation,[],[f167,f45]) ).
fof(f182,plain,
! [X0] : theorem(or(not(or(sF8,or(X0,sF3))),or(X0,sF9))),
inference(superposition,[],[f50,f39]) ).
fof(f201,plain,
! [X0] : theorem(or(not(or(sF4,or(X0,sF5))),or(X0,sF6))),
inference(superposition,[],[f50,f33]) ).
fof(f233,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f249,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f260,plain,
theorem(or(not(sF2),sF3)),
inference(superposition,[],[f233,f27]) ).
fof(f261,plain,
theorem(or(not(sF2),sF5)),
inference(superposition,[],[f233,f31]) ).
fof(f263,plain,
theorem(or(not(sF5),sF6)),
inference(superposition,[],[f233,f33]) ).
fof(f265,plain,
theorem(or(sF8,sF6)),
inference(forward_demodulation,[],[f263,f37]) ).
fof(f276,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f249,f18]) ).
fof(f279,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f90,f18]) ).
fof(f282,plain,
! [X0] :
( theorem(or(not(sF3),or(sF1,X0)))
| ~ theorem(or(not(sF2),X0)) ),
inference(superposition,[],[f90,f27]) ).
fof(f283,plain,
! [X0] :
( theorem(or(not(sF5),or(p,X0)))
| ~ theorem(or(not(sF2),X0)) ),
inference(superposition,[],[f90,f31]) ).
fof(f295,plain,
! [X0] :
( theorem(or(sF8,or(p,X0)))
| ~ theorem(or(not(sF2),X0)) ),
inference(forward_demodulation,[],[f283,f37]) ).
fof(f296,plain,
! [X0] :
( theorem(or(sF4,or(sF1,X0)))
| ~ theorem(or(not(sF2),X0)) ),
inference(forward_demodulation,[],[f282,f29]) ).
fof(f300,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f279,f51]) ).
fof(f301,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f279,f90]) ).
fof(f303,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f279,f233]) ).
fof(f304,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f279,f249]) ).
fof(f307,plain,
! [X0,X1] :
( ~ theorem(or(sF1,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF0)) ),
inference(superposition,[],[f279,f23]) ).
fof(f309,plain,
! [X0,X1] :
( ~ theorem(or(sF8,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF5)) ),
inference(superposition,[],[f279,f37]) ).
fof(f310,plain,
! [X0,X1] :
( ~ theorem(or(sF7,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF6)) ),
inference(superposition,[],[f279,f35]) ).
fof(f311,plain,
! [X0,X1] :
( ~ theorem(or(sF10,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF9)) ),
inference(superposition,[],[f279,f41]) ).
fof(f316,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f304,f233]) ).
fof(f322,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f300,f233]) ).
fof(f334,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f316,f91]) ).
fof(f341,plain,
theorem(or(sF10,sF9)),
inference(superposition,[],[f316,f41]) ).
fof(f355,plain,
theorem(or(sF10,or(sF12,sF7))),
inference(resolution,[],[f169,f146]) ).
fof(f359,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f301,f51]) ).
fof(f361,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ),
inference(resolution,[],[f301,f50]) ).
fof(f376,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f303,f300]) ).
fof(f387,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f359,f18]) ).
fof(f410,plain,
theorem(or(sF10,or(sF7,sF12))),
inference(resolution,[],[f355,f300]) ).
fof(f507,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f361,f18]) ).
fof(f544,plain,
theorem(or(not(p),sF5)),
inference(superposition,[],[f322,f31]) ).
fof(f548,plain,
theorem(or(sF0,sF5)),
inference(forward_demodulation,[],[f544,f21]) ).
fof(f572,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f507,f249]) ).
fof(f607,plain,
! [X0] :
( ~ theorem(or(X0,sF1))
| theorem(or(X0,sF3)) ),
inference(superposition,[],[f376,f27]) ).
fof(f619,plain,
! [X0] :
( theorem(or(X0,or(sF7,sF12)))
| ~ theorem(or(X0,sF9)) ),
inference(resolution,[],[f311,f410]) ).
fof(f675,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f387,f334]) ).
fof(f806,definition,
( spl13_33
<=> theorem(or(sF7,sF12)) ),
introduced(definition,[new_symbols(definition,[spl13_33])],[avatar_definition]) ).
fof(f807,plain,
( ~ theorem(or(sF7,sF12))
| spl13_33 ),
inference(avatar_component_clause,[],[f806]) ).
fof(f808,plain,
( theorem(or(sF7,sF12))
| ~ spl13_33 ),
inference(avatar_component_clause,[],[f806]) ).
fof(f818,plain,
( ! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF12)) )
| ~ spl13_33 ),
inference(resolution,[],[f808,f310]) ).
fof(f822,plain,
( theorem(or(sF8,sF12))
| ~ spl13_33 ),
inference(resolution,[],[f818,f265]) ).
fof(f824,plain,
( ! [X0] :
( ~ theorem(or(X0,sF5))
| theorem(or(X0,sF12)) )
| ~ spl13_33 ),
inference(resolution,[],[f822,f309]) ).
fof(f1028,plain,
( theorem(or(sF0,sF12))
| ~ spl13_33 ),
inference(resolution,[],[f548,f824]) ).
fof(f1030,plain,
( theorem(or(sF12,sF0))
| ~ spl13_33 ),
inference(resolution,[],[f1028,f91]) ).
fof(f1601,plain,
( ~ theorem(or(sF3,sF9))
| theorem(sF9) ),
inference(superposition,[],[f572,f39]) ).
fof(f1606,plain,
( ~ theorem(or(sF3,sF9))
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f1601,f101]) ).
fof(f1624,plain,
! [X0] :
( ~ theorem(or(sF8,or(X0,sF3)))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f182,f18]) ).
fof(f1634,plain,
( theorem(or(p,sF9))
| ~ theorem(or(not(sF2),sF3)) ),
inference(resolution,[],[f1624,f295]) ).
fof(f1642,plain,
theorem(or(p,sF9)),
inference(forward_subsumption_resolution,[],[f1634,f260]) ).
fof(f1659,plain,
! [X0] :
( theorem(or(X0,not(sF0)))
| ~ theorem(or(p,X0)) ),
inference(superposition,[],[f675,f21]) ).
fof(f1667,plain,
! [X0] :
( ~ theorem(or(p,X0))
| theorem(or(X0,sF1)) ),
inference(forward_demodulation,[],[f1659,f23]) ).
fof(f1696,plain,
theorem(or(sF9,sF1)),
inference(resolution,[],[f1667,f1642]) ).
fof(f1716,plain,
theorem(or(sF9,sF3)),
inference(resolution,[],[f1696,f607]) ).
fof(f1720,plain,
theorem(or(sF3,sF9)),
inference(resolution,[],[f1716,f91]) ).
fof(f1721,plain,
( $false
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f1720,f1606]) ).
fof(f1722,plain,
spl13_1,
inference(avatar_contradiction_clause,[],[f1721]) ).
fof(f1737,plain,
( theorem(or(sF7,sF12))
| ~ theorem(or(sF10,sF9))
| ~ spl13_2 ),
inference(resolution,[],[f104,f619]) ).
fof(f1741,plain,
( ~ theorem(or(sF10,sF9))
| ~ spl13_2
| spl13_33 ),
inference(forward_subsumption_resolution,[],[f1737,f807]) ).
fof(f1746,plain,
( $false
| ~ spl13_2
| spl13_33 ),
inference(forward_subsumption_resolution,[],[f1741,f341]) ).
fof(f1747,plain,
( ~ spl13_2
| spl13_33 ),
inference(avatar_contradiction_clause,[],[f1746]) ).
fof(f1759,plain,
( ! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF12)) )
| ~ spl13_33 ),
inference(resolution,[],[f808,f310]) ).
fof(f2032,plain,
! [X0] :
( ~ theorem(or(sF4,or(X0,sF5)))
| theorem(or(X0,sF6)) ),
inference(resolution,[],[f201,f18]) ).
fof(f2042,plain,
( theorem(or(sF1,sF6))
| ~ theorem(or(not(sF2),sF5)) ),
inference(resolution,[],[f2032,f296]) ).
fof(f2050,plain,
theorem(or(sF1,sF6)),
inference(forward_subsumption_resolution,[],[f2042,f261]) ).
fof(f2052,plain,
( theorem(or(sF1,sF12))
| ~ spl13_33 ),
inference(resolution,[],[f2050,f1759]) ).
fof(f2054,plain,
( ! [X0] :
( ~ theorem(or(X0,sF0))
| theorem(or(X0,sF12)) )
| ~ spl13_33 ),
inference(resolution,[],[f2052,f307]) ).
fof(f2063,plain,
( theorem(or(sF12,sF12))
| ~ spl13_33 ),
inference(resolution,[],[f2054,f1030]) ).
fof(f2067,plain,
( theorem(sF12)
| ~ spl13_33 ),
inference(resolution,[],[f2063,f276]) ).
fof(f2069,plain,
( $false
| ~ spl13_33 ),
inference(forward_subsumption_resolution,[],[f2067,f46]) ).
fof(f2070,plain,
~ spl13_33,
inference(avatar_contradiction_clause,[],[f2069]) ).
cnf(s1,plain,
( ~ spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f105]) ).
cnf(s59,plain,
spl13_1,
inference(sat_conversion,[],[f1722]) ).
cnf(s64,plain,
( ~ spl13_2
| spl13_33 ),
inference(sat_conversion,[],[f1747]) ).
cnf(s74,plain,
~ spl13_33,
inference(sat_conversion,[],[f2070]) ).
cnf(s76,plain,
~ spl13_2,
inference(rat,[],[s64,s74]) ).
cnf(s85,plain,
$false,
inference(rat,[],[s1,s76,s59]) ).
fof(f2071,plain,
$false,
inference(avatar_sat_refutation,[],[s85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL300-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n013.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 27 15:32:36 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.76/3.51 % (357716)Input is clausal, will run a generic CNF schedule.
% 9.76/3.51 % (357722)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1335301377:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 9.76/3.51 % (357721)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=3357980250:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 9.76/3.51 % (357724)lrs+10_1_sil=8000:sp=occurrence:random_seed=2316452055:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 9.76/3.51 % (357725)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3036576265:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 9.76/3.51 % (357723)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=305558469:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 9.76/3.51 % (357727)dis-21_1_sil=8000:lcm=predicate:random_seed=391747208:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 9.76/3.51 % (357726)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3970940686:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 9.76/3.51 % (357727)Instruction limit reached!
% 9.76/3.51 % (357727)------------------------------
% 9.76/3.51 % (357727)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357727)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357727)Termination reason: Instruction limit
% 9.76/3.51 % (357727)Termination phase: Saturation
% 9.76/3.51 % (357727)Time elapsed: 0.089 s
% 9.76/3.51 % (357727)Peak memory usage: 87 MB
% 9.76/3.51 % (357727)Instructions burned: 118 (million)
% 9.76/3.51 % (357725)Instruction limit reached!
% 9.76/3.51 % (357725)------------------------------
% 9.76/3.51 % (357725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357725)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357725)Termination reason: Instruction limit
% 9.76/3.51 % (357725)Termination phase: Saturation
% 9.76/3.51 % (357725)Time elapsed: 0.106 s
% 9.76/3.51 % (357725)Peak memory usage: 88 MB
% 9.76/3.51 % (357725)Instructions burned: 114 (million)
% 9.76/3.51 % (357724)Instruction limit reached!
% 9.76/3.51 % (357724)------------------------------
% 9.76/3.51 % (357724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357724)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357724)Termination reason: Instruction limit
% 9.76/3.51 % (357724)Termination phase: Saturation
% 9.76/3.51 % (357724)Time elapsed: 0.108 s
% 9.76/3.51 % (357724)Peak memory usage: 89 MB
% 9.76/3.51 % (357724)Instructions burned: 108 (million)
% 9.76/3.51 % (357726)Instruction limit reached!
% 9.76/3.51 % (357726)------------------------------
% 9.76/3.51 % (357726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357726)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357726)Termination reason: Instruction limit
% 9.76/3.51 % (357726)Termination phase: Saturation
% 9.76/3.51 % (357726)Time elapsed: 0.171 s
% 9.76/3.51 % (357726)Peak memory usage: 89 MB
% 9.76/3.51 % (357726)Instructions burned: 180 (million)
% 9.76/3.51 % (357736)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=335089657:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 9.76/3.51 % (357735)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2841945843:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 9.76/3.51 % (357736)Refutation not found, incomplete strategy
% 9.76/3.51 % (357736)------------------------------
% 9.76/3.51 % (357736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357735)Refutation not found, incomplete strategy
% 9.76/3.51 % (357735)------------------------------
% 9.76/3.51 % (357735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357735)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357735)Termination reason: Refutation not found, incomplete strategy
% 9.76/3.51 % (357735)Time elapsed: 0.002 s
% 9.76/3.51 % (357735)Peak memory usage: 87 MB
% 9.76/3.51 % (357736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357736)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357736)Termination reason: Refutation not found, incomplete strategy
% 9.76/3.51 % (357736)Time elapsed: 0.002 s
% 9.76/3.51 % (357736)Peak memory usage: 87 MB
% 9.76/3.51 % (357737)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1677455217:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 9.76/3.51 % (357737)Refutation not found, incomplete strategy
% 9.76/3.51 % (357737)------------------------------
% 9.76/3.51 % (357737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357737)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357737)Termination reason: Refutation not found, incomplete strategy
% 9.76/3.51 % (357737)Time elapsed: 0.003 s
% 9.76/3.51 % (357737)Peak memory usage: 88 MB
% 9.76/3.51 % (357737)Instructions burned: 1 (million)
% 9.76/3.51 % (357738)lrs+10_64_to=lpo:sil=8000:random_seed=724604327:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 9.76/3.51 % (357738)Instruction limit reached!
% 9.76/3.51 % (357738)------------------------------
% 9.76/3.51 % (357738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357738)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357738)Termination reason: Instruction limit
% 9.76/3.51 % (357738)Termination phase: Saturation
% 9.76/3.51 % (357738)Time elapsed: 0.113 s
% 9.76/3.51 % (357738)Peak memory usage: 89 MB
% 9.76/3.51 % (357738)Instructions burned: 127 (million)
% 9.76/3.51 % (357735)------------------------------
% 9.76/3.51 % (357735)------------------------------
% 9.76/3.51 % (357736)------------------------------
% 9.76/3.51 % (357736)------------------------------
% 9.76/3.51 % (357737)------------------------------
% 9.76/3.51 % (357737)------------------------------
% 9.76/3.51 % (357743)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1461454236:avsq=on:i=194:fgj=on:bd=preordered_2991 on theBenchmark for (2991ds/194Mi)
% 9.76/3.51 % (357745)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2470480555:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 9.76/3.51 % (357744)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3637152615:i=157:gtg=all_2989 on theBenchmark for (2989ds/157Mi)
% 9.76/3.51 % (357743)Instruction limit reached!
% 9.76/3.51 % (357743)------------------------------
% 9.76/3.51 % (357743)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357743)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357743)Termination reason: Instruction limit
% 9.76/3.51 % (357743)Termination phase: Saturation
% 9.76/3.51 % (357743)Time elapsed: 0.192 s
% 9.76/3.51 % (357743)Peak memory usage: 90 MB
% 9.76/3.51 % (357743)Instructions burned: 194 (million)
% 9.76/3.51 % (357746)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=2463291501:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2989 on theBenchmark for (2989ds/106Mi)
% 9.76/3.51 % (357746)Instruction limit reached!
% 9.76/3.51 % (357746)------------------------------
% 9.76/3.51 % (357746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357746)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357746)Termination reason: Instruction limit
% 9.76/3.51 % (357746)Termination phase: Saturation
% 9.76/3.51 % (357746)Time elapsed: 0.090 s
% 9.76/3.51 % (357746)Peak memory usage: 89 MB
% 9.76/3.51 % (357746)Instructions burned: 106 (million)
% 9.76/3.51 % (357744)Instruction limit reached!
% 9.76/3.51 % (357744)------------------------------
% 9.76/3.51 % (357744)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357744)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357744)Termination reason: Instruction limit
% 9.76/3.51 % (357744)Termination phase: Saturation
% 9.76/3.51 % (357744)Time elapsed: 0.157 s
% 9.76/3.51 % (357744)Peak memory usage: 91 MB
% 9.76/3.51 % (357744)Instructions burned: 157 (million)
% 9.76/3.51 % (357750)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=2776723612:i=107_2986 on theBenchmark for (2986ds/107Mi)
% 9.76/3.51 % (357750)Refutation not found, incomplete strategy
% 9.76/3.51 % (357750)------------------------------
% 9.76/3.51 % (357750)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357750)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357750)Termination reason: Refutation not found, incomplete strategy
% 9.76/3.51 % (357750)Time elapsed: 0.002 s
% 9.76/3.51 % (357750)Peak memory usage: 87 MB
% 9.76/3.51 % (357752)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3406031237:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2985 on theBenchmark for (2985ds/242Mi)
% 9.76/3.51 % (357753)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=215978560:cond=fast:i=5208:av=off_2985 on theBenchmark for (2985ds/5208Mi)
% 9.76/3.51 % (357721)First to succeed.
% 9.76/3.51 % (357721)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-357716"
% 9.76/3.51 % (357750)------------------------------
% 9.76/3.51 % (357750)------------------------------
% 9.76/3.51 % (357752)Instruction limit reached!
% 9.76/3.51 % (357752)------------------------------
% 9.76/3.51 % (357752)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.76/3.51 % (357752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.76/3.51 % (357752)CaDiCaL version: 2.1.3
% 9.76/3.51 % (357752)Termination reason: Instruction limit
% 9.76/3.51 % (357752)Termination phase: Saturation
% 9.76/3.51 % (357752)Time elapsed: 0.252 s
% 9.76/3.51 % (357752)Peak memory usage: 91 MB
% 9.76/3.51 % (357752)Instructions burned: 243 (million)
% 9.76/3.51 % (357721)Refutation found. Thanks to Tanya!
% 9.76/3.51 % SZS status Unsatisfiable for theBenchmark
% 9.76/3.51 % SZS output start Proof for theBenchmark
% See solution above
% 17.11/3.89 % (357721)------------------------------
% 17.11/3.89 % (357721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.11/3.89 % (357721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.11/3.89 % (357721)CaDiCaL version: 2.1.3
% 17.11/3.89 % (357721)Termination reason: Refutation
% 17.11/3.89 % (357721)Time elapsed: 1.545 s
% 17.11/3.89 % (357721)Peak memory usage: 133 MB
% 17.11/3.89 % (357721)Instructions burned: 1421 (million)
% 17.11/3.89 % (357721)------------------------------
% 17.11/3.89 % (357721)------------------------------
% 17.11/3.89 % (357716)Success in time 2.278 s
% 17.11/3.89 % Vampire exiting
%------------------------------------------------------------------------------