%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL203-10 : TPTP v9.3.1. Released v7.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:32 AM UTC 2026
% Result : Unsatisfiable 9.14s 2.23s
% Output : Refutation 9.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 52 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 121 ( 121 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,plain,
! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f13,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f15,plain,
! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(not(or(p,q)),or(not(p),not(q)))),
inference(reorient_equations,[],[f16]) ).
fof(f19,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f21,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f22,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f10,f11,f11,f11]) ).
fof(f23,plain,
! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(definition_unfolding,[],[f15,f11]) ).
fof(f24,plain,
true != theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
inference(definition_unfolding,[],[f17,f11]) ).
fof(f25,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f26,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f19]) ).
fof(f27,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),true),
inference(superposition,[],[f13,f21]) ).
fof(f28,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true),
inference(superposition,[],[f13,f22]) ).
fof(f31,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f28,f1]) ).
fof(f32,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f27,f1]) ).
fof(f33,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f26,f1]) ).
fof(f34,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f25,f1]) ).
fof(f43,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),true),
inference(superposition,[],[f23,f32]) ).
fof(f46,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true),
inference(superposition,[],[f23,f31]) ).
fof(f59,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),
inference(forward_demodulation,[],[f46,f1]) ).
fof(f62,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f43,f1]) ).
fof(f66,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),true),
inference(superposition,[],[f62,f31]) ).
fof(f73,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),
inference(forward_demodulation,[],[f66,f1]) ).
fof(f87,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true),true),
inference(superposition,[],[f23,f73]) ).
fof(f96,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true),
inference(forward_demodulation,[],[f87,f1]) ).
fof(f98,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f59,f34]) ).
fof(f114,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f98,f1]) ).
fof(f131,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f23,f114]) ).
fof(f139,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f131,f1]) ).
fof(f143,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f139,f33]) ).
fof(f163,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f143,f1]) ).
fof(f216,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(or(X0,X1)),X2)),or(not(X0),X2))),true),
inference(superposition,[],[f96,f163]) ).
fof(f231,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(or(X0,X1)),X2)),or(not(X0),X2))),
inference(forward_demodulation,[],[f216,f1]) ).
fof(f638,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X0),X2)),true),true),
inference(superposition,[],[f23,f231]) ).
fof(f660,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X0),X2)),true),
inference(forward_demodulation,[],[f638,f1]) ).
fof(f666,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(not(or(X0,X1))),or(not(X0),X2))),true),
inference(superposition,[],[f660,f231]) ).
fof(f726,plain,
! [X2,X0,X1] : true = theorem(or(not(not(or(X0,X1))),or(not(X0),X2))),
inference(forward_demodulation,[],[f666,f1]) ).
fof(f1167,plain,
true != true,
inference(superposition,[],[f24,f726]) ).
fof(f1186,plain,
$false,
inference(trivial_inequality_removal,[],[f1167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 15:26:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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
% 7.67/2.05 % (350836)Detected a unit-equality problem, will run specialized UEQ schedule.
% 7.67/2.05 % (350847)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=13525262:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 7.67/2.05 % (350845)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=796463209:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 7.67/2.05 % (350841)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=47415019:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 7.67/2.05 % (350842)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4285112180:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 7.67/2.05 % (350844)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=368796658:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 7.67/2.05 % (350843)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3991216734:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 7.67/2.05 % (350846)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1099272482:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 7.67/2.05 % (350844)Instruction limit reached!
% 7.67/2.05 % (350844)------------------------------
% 7.67/2.05 % (350844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.67/2.05 % (350844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.67/2.05 % (350844)CaDiCaL version: 2.1.3
% 7.67/2.05 % (350844)Termination reason: Instruction limit
% 7.67/2.05 % (350844)Termination phase: Saturation
% 7.67/2.05 % (350844)Time elapsed: 0.084 s
% 7.67/2.05 % (350844)Peak memory usage: 89 MB
% 7.67/2.05 % (350844)Instructions burned: 136 (million)
% 7.67/2.05 % (350845)Instruction limit reached!
% 7.67/2.05 % (350845)------------------------------
% 7.67/2.05 % (350845)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.67/2.05 % (350845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.67/2.05 % (350845)CaDiCaL version: 2.1.3
% 7.67/2.05 % (350845)Termination reason: Instruction limit
% 7.67/2.05 % (350845)Termination phase: Saturation
% 7.67/2.05 % (350845)Time elapsed: 0.104 s
% 7.67/2.05 % (350845)Peak memory usage: 89 MB
% 7.67/2.05 % (350845)Instructions burned: 182 (million)
% 7.67/2.05 % (350846)Instruction limit reached!
% 7.67/2.05 % (350846)------------------------------
% 7.67/2.05 % (350846)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.67/2.05 % (350846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.67/2.05 % (350846)CaDiCaL version: 2.1.3
% 7.67/2.05 % (350846)Termination reason: Instruction limit
% 7.67/2.05 % (350846)Termination phase: Saturation
% 7.67/2.05 % (350846)Time elapsed: 0.148 s
% 7.67/2.05 % (350846)Peak memory usage: 90 MB
% 7.67/2.05 % (350846)Instructions burned: 257 (million)
% 7.67/2.05 % (350855)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2880529136:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 7.67/2.05 % (350856)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3810216294:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 7.67/2.05 % (350857)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1703032468:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 7.67/2.05 % (350847)Instruction limit reached!
% 7.67/2.05 % (350847)------------------------------
% 7.67/2.05 % (350847)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.67/2.05 % (350847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.67/2.05 % (350847)CaDiCaL version: 2.1.3
% 7.67/2.05 % (350847)Termination reason: Instruction limit
% 7.67/2.05 % (350847)Termination phase: Saturation
% 7.67/2.05 % (350847)Time elapsed: 0.376 s
% 7.67/2.05 % (350847)Peak memory usage: 101 MB
% 7.67/2.05 % (350847)Instructions burned: 1188 (million)
% 9.14/2.23 % (350857)Instruction limit reached!
% 9.14/2.23 % (350857)------------------------------
% 9.14/2.23 % (350857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.14/2.23 % (350857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.14/2.23 % (350857)CaDiCaL version: 2.1.3
% 9.14/2.23 % (350857)Termination reason: Instruction limit
% 9.14/2.23 % (350857)Termination phase: Saturation
% 9.14/2.23 % (350857)Time elapsed: 0.109 s
% 9.14/2.23 % (350857)Peak memory usage: 88 MB
% 9.14/2.23 % (350857)Instructions burned: 216 (million)
% 9.14/2.23 % (350861)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=2456595985:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 9.14/2.23 % (350861)Instruction limit reached!
% 9.14/2.23 % (350861)------------------------------
% 9.14/2.23 % (350861)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.14/2.23 % (350861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.14/2.23 % (350861)CaDiCaL version: 2.1.3
% 9.14/2.23 % (350861)Termination reason: Instruction limit
% 9.14/2.23 % (350861)Termination phase: Saturation
% 9.14/2.23 % (350861)Time elapsed: 0.109 s
% 9.14/2.23 % (350861)Peak memory usage: 94 MB
% 9.14/2.23 % (350861)Instructions burned: 319 (million)
% 9.14/2.23 % (350862)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=2051877320:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 9.14/2.23 % (350864)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=824999375:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2992 on theBenchmark for (2992ds/2836Mi)
% 9.14/2.23 % (350842)First to succeed.
% 9.14/2.23 % (350842)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-350836"
% 9.14/2.23 % (350841)Also succeeded, but the first one will report.
% 9.14/2.23 % (350843)Also succeeded, but the first one will report.
% 9.14/2.23 % (350842)Refutation found. Thanks to Tanya!
% 9.14/2.23 % SZS status Unsatisfiable for theBenchmark
% 9.14/2.23 % SZS output start Proof for theBenchmark
% See solution above
% 9.14/2.23 % (350842)------------------------------
% 9.14/2.23 % (350842)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.14/2.23 % (350842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.14/2.23 % (350842)CaDiCaL version: 2.1.3
% 9.14/2.23 % (350842)Termination reason: Refutation
% 9.14/2.23 % (350842)Time elapsed: 0.770 s
% 9.14/2.23 % (350842)Peak memory usage: 129 MB
% 9.14/2.23 % (350842)Instructions burned: 1169 (million)
% 9.14/2.23 % (350842)------------------------------
% 9.14/2.23 % (350842)------------------------------
% 9.14/2.23 % (350836)Success in time 1.21 s
% 9.14/2.23 % Vampire exiting
%------------------------------------------------------------------------------