%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL326-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 : n008.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:59 AM UTC 2026
% Result : Unsatisfiable 4.35s 1.81s
% Output : Refutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 30 unt; 0 def)
% Number of atoms : 61 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 78 !; 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(not(equivalent(p,not(p)))),
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,
~ theorem(not(not(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))))),
inference(definition_unfolding,[],[f11,f12]) ).
fof(f14,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f15,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(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,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f18,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f19,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f18,f7]) ).
fof(f21,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f19,f7]) ).
fof(f24,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f17,f7]) ).
fof(f25,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f21,f14]) ).
fof(f26,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f28,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f15,f7]) ).
fof(f29,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f24,f14]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f26,f14]) ).
fof(f34,plain,
! [X0] : theorem(or(X0,not(or(X0,X0)))),
inference(resolution,[],[f29,f21]) ).
fof(f36,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f28,f14]) ).
fof(f48,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f30,f20]) ).
fof(f51,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f30,f28]) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f36,f14]) ).
fof(f63,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f48,f25]) ).
fof(f67,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f63,f29]) ).
fof(f72,plain,
! [X0] :
( theorem(not(not(X0)))
| ~ theorem(X0) ),
inference(resolution,[],[f67,f14]) ).
fof(f78,plain,
~ theorem(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))),
inference(resolution,[],[f72,f13]) ).
fof(f94,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f55,f21]) ).
fof(f98,plain,
! [X0,X1] :
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f55,f34]) ).
fof(f125,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f51,f14]) ).
fof(f360,plain,
! [X0,X1] :
( theorem(or(not(or(not(X1),not(X1))),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f98,f29]) ).
fof(f415,plain,
! [X0,X1] :
( theorem(or(not(or(not(X1),X0)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f125,f94]) ).
fof(f2132,plain,
~ theorem(or(not(or(not(not(p)),p)),p)),
inference(resolution,[],[f360,f78]) ).
fof(f2151,plain,
~ theorem(or(p,not(p))),
inference(resolution,[],[f2132,f415]) ).
fof(f2157,plain,
$false,
inference(forward_subsumption_resolution,[],[f2151,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL326-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.21/0.47 % Computer : n008.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 27 15:35:09 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.53 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
% 4.35/1.81 % (1393504)Input is clausal, will run a generic CNF schedule.
% 4.35/1.81 % (1393512)lrs+10_1_sil=8000:sp=occurrence:random_seed=194160677:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.35/1.81 % (1393512)First to succeed.
% 4.35/1.81 % (1393512)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1393504"
% 4.35/1.81 % (1393509)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=1534493495:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.35/1.81 % (1393510)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3501823455:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.35/1.81 % (1393511)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1166918009:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.35/1.81 % (1393513)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3318754724:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.35/1.81 % (1393514)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3129128504:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.35/1.81 % (1393515)dis-21_1_sil=8000:lcm=predicate:random_seed=128081411: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)
% 4.35/1.81 % (1393513)Also succeeded, but the first one will report.
% 4.35/1.81 % (1393515)Instruction limit reached!
% 4.35/1.81 % (1393515)------------------------------
% 4.35/1.81 % (1393515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.35/1.81 % (1393515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.35/1.81 % (1393515)CaDiCaL version: 2.1.3
% 4.35/1.81 % (1393515)Termination reason: Instruction limit
% 4.35/1.81 % (1393515)Termination phase: Saturation
% 4.35/1.81 % (1393515)Time elapsed: 0.098 s
% 4.35/1.81 % (1393515)Peak memory usage: 87 MB
% 4.35/1.81 % (1393515)Instructions burned: 117 (million)
% 4.35/1.81 % (1393512)Refutation found. Thanks to Tanya!
% 4.35/1.81 % SZS status Unsatisfiable for theBenchmark
% 4.35/1.81 % SZS output start Proof for theBenchmark
% See solution above
% 4.35/1.81 % (1393512)------------------------------
% 4.35/1.81 % (1393512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.35/1.81 % (1393512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.35/1.81 % (1393512)CaDiCaL version: 2.1.3
% 4.35/1.81 % (1393512)Termination reason: Refutation
% 4.35/1.81 % (1393512)Time elapsed: 0.039 s
% 4.35/1.81 % (1393512)Peak memory usage: 89 MB
% 4.35/1.81 % (1393512)Instructions burned: 73 (million)
% 4.35/1.81 % (1393512)------------------------------
% 4.35/1.81 % (1393512)------------------------------
% 4.35/1.81 % (1393504)Success in time 0.5 s
% 4.35/1.81 % Vampire exiting
%------------------------------------------------------------------------------