%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL519+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:52:50 AM UTC 2026
% Result : Theorem 9.21s 2.17s
% Output : Refutation 9.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 18
% Syntax : Number of formulae : 102 ( 48 unt; 0 def)
% Number of atoms : 176 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 134 ( 60 ~; 56 |; 2 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 177 ( 175 !; 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/theBenchmark.p',modus_ponens) ).
fof(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn3) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f43,conjecture,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f44,negated_conjecture,
~ r2,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r2,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
=> r2 ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f51,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(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r2
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f58]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f53]) ).
fof(f67,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f69,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f57]) ).
fof(f70,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f59]) ).
fof(f72,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f60]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f61]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f79,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f82,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f87,plain,
~ r2,
inference(cnf_transformation,[],[f45]) ).
fof(f89,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f74,f84]) ).
fof(f90,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f73,f77]) ).
fof(f91,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f72,f85]) ).
fof(f92,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f71,f76]) ).
fof(f93,plain,
~ is_a_theorem(implies(sK1,or(sK0,sK1))),
inference(forward_subsumption_resolution,[],[f70,f87]) ).
fof(f94,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(forward_subsumption_resolution,[],[f69,f82]) ).
fof(f95,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f68,f81]) ).
fof(f96,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f67,f80]) ).
fof(f98,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f65,f79]) ).
fof(f99,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f91,f89]) ).
fof(f100,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f92,f90]) ).
fof(f103,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f100,f90]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(and(X1,X2)),not(and(X2,X0)))) ),
inference(resolution,[],[f94,f98]) ).
fof(f111,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X0)),implies(X0,X1)))),
inference(superposition,[],[f94,f90]) ).
fof(f113,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f111,f100]) ).
fof(f115,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f108,f100]) ).
fof(f116,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f113,f100]) ).
fof(f120,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,not(X0)),or(X0,X1)))),
inference(superposition,[],[f116,f100]) ).
fof(f121,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),implies(implies(X2,X0),or(X0,X1)))),
inference(forward_demodulation,[],[f120,f103]) ).
fof(f122,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f121,f98]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f122,f98]) ).
fof(f131,plain,
! [X0,X1] : and(not(X0),X1) = not(or(X0,not(X1))),
inference(superposition,[],[f99,f100]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,not(X0))) ),
inference(superposition,[],[f126,f89]) ).
fof(f145,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(or(X1,not(X0))) ),
inference(resolution,[],[f140,f95]) ).
fof(f150,plain,
! [X0] : is_a_theorem(or(X0,not(X0))),
inference(resolution,[],[f145,f96]) ).
fof(f153,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f150,f126]) ).
fof(f160,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ),
inference(forward_demodulation,[],[f153,f100]) ).
fof(f169,plain,
! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f160,f89]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X0),X2))
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f169,f126]) ).
fof(f181,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,not(X1))) ),
inference(superposition,[],[f169,f89]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ),
inference(forward_demodulation,[],[f177,f100]) ).
fof(f189,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(and(X0,X1),X2))
| is_a_theorem(or(not(and(X1,X3)),X2))
| ~ is_a_theorem(implies(X3,X0)) ),
inference(resolution,[],[f184,f115]) ).
fof(f191,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(not(X2),X1))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f184,f169]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,X1)) ),
inference(forward_demodulation,[],[f191,f89]) ).
fof(f196,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(and(X0,X1),X2))
| is_a_theorem(implies(and(X1,X3),X2))
| ~ is_a_theorem(implies(X3,X0)) ),
inference(forward_demodulation,[],[f189,f89]) ).
fof(f202,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(and(X0,X2),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f194,f95]) ).
fof(f234,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(and(X0,X1),X2)) ),
inference(resolution,[],[f196,f202]) ).
fof(f293,plain,
! [X0,X1] : not(implies(X0,not(X1))) = and(not(not(X0)),X1),
inference(superposition,[],[f131,f89]) ).
fof(f303,plain,
! [X0,X1] : and(X0,X1) = and(not(not(X0)),X1),
inference(forward_demodulation,[],[f293,f99]) ).
fof(f310,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),and(X0,not(not(X0))))),
inference(superposition,[],[f96,f303]) ).
fof(f334,plain,
! [X0] : is_a_theorem(or(not(X0),and(X0,not(not(X0))))),
inference(forward_demodulation,[],[f310,f100]) ).
fof(f342,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,not(not(X0))))),
inference(forward_demodulation,[],[f334,f89]) ).
fof(f1811,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(implies(and(X3,X0),X1)) ),
inference(resolution,[],[f234,f95]) ).
fof(f1830,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(resolution,[],[f1811,f342]) ).
fof(f1868,plain,
! [X0,X1] : is_a_theorem(implies(X0,not(and(X1,not(X0))))),
inference(resolution,[],[f1830,f181]) ).
fof(f1878,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_demodulation,[],[f1868,f90]) ).
fof(f1899,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(superposition,[],[f1878,f100]) ).
fof(f1925,plain,
$false,
inference(resolution,[],[f1899,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL519+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n015.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:59:01 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.21/2.17 % (1816776)Detected formulas, will run a generic FOF schedule.
% 9.21/2.17 % (1816786)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1865045672:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.21/2.17 % (1816787)dis-21_1_sil=8000:lcm=predicate:random_seed=1588226910:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 9.21/2.17 % (1816783)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=242751115:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.21/2.17 % (1816784)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1872128369:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.21/2.17 % (1816785)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1505521240:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.21/2.17 % (1816781)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=3670568502:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.21/2.17 % (1816782)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3885877076:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.21/2.17 % (1816785)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816785)------------------------------
% 9.21/2.17 % (1816785)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816784)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816784)------------------------------
% 9.21/2.17 % (1816784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816784)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816785)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816784)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816784)Time elapsed: 0.001 s
% 9.21/2.17 % (1816785)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816785)Time elapsed: 0.001 s
% 9.21/2.17 % (1816784)Peak memory usage: 86 MB
% 9.21/2.17 % (1816785)Peak memory usage: 86 MB
% 9.21/2.17 % (1816787)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816787)------------------------------
% 9.21/2.17 % (1816787)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816787)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816787)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816787)Time elapsed: 0.002 s
% 9.21/2.17 % (1816787)Peak memory usage: 88 MB
% 9.21/2.17 % (1816787)Instructions burned: 1 (million)
% 9.21/2.17 % (1816786)Instruction limit reached!
% 9.21/2.17 % (1816786)------------------------------
% 9.21/2.17 % (1816786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816786)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816786)Termination reason: Instruction limit
% 9.21/2.17 % (1816786)Termination phase: Saturation
% 9.21/2.17 % (1816786)Time elapsed: 0.050 s
% 9.21/2.17 % (1816786)Peak memory usage: 90 MB
% 9.21/2.17 % (1816786)Instructions burned: 141 (million)
% 9.21/2.17 % (1816795)lrs+10_1_sil=8000:sp=occurrence:random_seed=679020233:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 9.21/2.17 % (1816795)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816795)------------------------------
% 9.21/2.17 % (1816795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816795)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816795)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816795)Time elapsed: 0.0000 s
% 9.21/2.17 % (1816795)Peak memory usage: 87 MB
% 9.21/2.17 % (1816787)------------------------------
% 9.21/2.17 % (1816787)------------------------------
% 9.21/2.17 % (1816785)------------------------------
% 9.21/2.17 % (1816785)------------------------------
% 9.21/2.17 % (1816784)------------------------------
% 9.21/2.17 % (1816784)------------------------------
% 9.21/2.17 % (1816795)------------------------------
% 9.21/2.17 % (1816795)------------------------------
% 9.21/2.17 % (1816798)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1988331151:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 9.21/2.17 % (1816797)lrs+10_1_sil=32000:urr=on:br=off:random_seed=793973521:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 9.21/2.17 % (1816799)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1554164691:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 9.21/2.17 % (1816798)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816798)------------------------------
% 9.21/2.17 % (1816798)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816797)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816797)------------------------------
% 9.21/2.17 % (1816797)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816798)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816798)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816798)Time elapsed: 0.001 s
% 9.21/2.17 % (1816797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816798)Peak memory usage: 86 MB
% 9.21/2.17 % (1816797)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816797)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816797)Time elapsed: 0.001 s
% 9.21/2.17 % (1816797)Peak memory usage: 87 MB
% 9.21/2.17 % (1816800)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3850882681:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.21/2.17 % (1816800)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816800)------------------------------
% 9.21/2.17 % (1816800)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816800)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816800)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816800)Time elapsed: 0.0000 s
% 9.21/2.17 % (1816800)Peak memory usage: 86 MB
% 9.21/2.17 % (1816800)------------------------------
% 9.21/2.17 % (1816800)------------------------------
% 9.21/2.17 % (1816783)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816783)------------------------------
% 9.21/2.17 % (1816783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816783)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816783)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816783)Time elapsed: 0.562 s
% 9.21/2.17 % (1816783)Peak memory usage: 125 MB
% 9.21/2.17 % (1816783)Instructions burned: 829 (million)
% 9.21/2.17 % (1816799)Instruction limit reached!
% 9.21/2.17 % (1816799)------------------------------
% 9.21/2.17 % (1816799)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816799)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816799)Termination reason: Instruction limit
% 9.21/2.17 % (1816799)Termination phase: Saturation
% 9.21/2.17 % (1816799)Time elapsed: 0.163 s
% 9.21/2.17 % (1816799)Peak memory usage: 92 MB
% 9.21/2.17 % (1816799)Instructions burned: 249 (million)
% 9.21/2.17 % (1816798)------------------------------
% 9.21/2.17 % (1816798)------------------------------
% 9.21/2.17 % (1816797)------------------------------
% 9.21/2.17 % (1816797)------------------------------
% 9.21/2.17 % (1816805)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1846550223:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 9.21/2.17 % (1816806)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2698904836:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 9.21/2.17 % (1816806)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816806)------------------------------
% 9.21/2.17 % (1816806)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816806)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816806)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816806)Time elapsed: 0.001 s
% 9.21/2.17 % (1816806)Peak memory usage: 88 MB
% 9.21/2.17 % (1816808)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=41783705:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 9.21/2.17 % (1816807)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=973118715:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 9.21/2.17 % (1816808)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816808)------------------------------
% 9.21/2.17 % (1816808)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816808)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816808)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816808)Time elapsed: 0.001 s
% 9.21/2.17 % (1816808)Peak memory usage: 87 MB
% 9.21/2.17 % (1816783)------------------------------
% 9.21/2.17 % (1816783)------------------------------
% 9.21/2.17 % (1816781)First to succeed.
% 9.21/2.17 % (1816781)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1816776"
% 9.21/2.17 % (1816807)Instruction limit reached!
% 9.21/2.17 % (1816807)------------------------------
% 9.21/2.17 % (1816807)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816807)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816807)Termination reason: Instruction limit
% 9.21/2.17 % (1816807)Termination phase: Saturation
% 9.21/2.17 % (1816807)Time elapsed: 0.070 s
% 9.21/2.17 % (1816807)Peak memory usage: 88 MB
% 9.21/2.17 % (1816807)Instructions burned: 128 (million)
% 9.21/2.17 % (1816806)------------------------------
% 9.21/2.17 % (1816806)------------------------------
% 9.21/2.17 % (1816813)lrs+10_1_sil=8000:sp=occurrence:random_seed=2223948209:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 9.21/2.17 % (1816814)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3015965558:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 9.21/2.17 % (1816814)Refutation not found, incomplete strategy
% 9.21/2.17 % (1816814)------------------------------
% 9.21/2.17 % (1816814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.17 % (1816814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.17 % (1816814)CaDiCaL version: 2.1.3
% 9.21/2.17 % (1816814)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.17 % (1816814)Time elapsed: 0.001 s
% 9.21/2.17 % (1816814)Peak memory usage: 88 MB
% 9.21/2.17 % (1816808)------------------------------
% 9.21/2.17 % (1816808)------------------------------
% 9.21/2.17 % (1816781)Refutation found. Thanks to Tanya!
% 9.21/2.17 % SZS status Theorem for theBenchmark
% 9.21/2.17 % SZS output start Proof for theBenchmark
% See solution above
% 9.74/2.36 % (1816781)------------------------------
% 9.74/2.36 % (1816781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.74/2.36 % (1816781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.74/2.36 % (1816781)CaDiCaL version: 2.1.3
% 9.74/2.36 % (1816781)Termination reason: Refutation
% 9.74/2.36 % (1816781)Time elapsed: 0.862 s
% 9.74/2.36 % (1816781)Peak memory usage: 130 MB
% 9.74/2.36 % (1816781)Instructions burned: 1275 (million)
% 9.74/2.36 % (1816781)------------------------------
% 9.74/2.36 % (1816781)------------------------------
% 9.74/2.36 % (1816776)Success in time 1.296 s
% 9.74/2.36 % Vampire exiting
%------------------------------------------------------------------------------