%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL294-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 : n016.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 0.30s 2.06s
% Output : Refutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 22 unt; 1 def)
% Number of atoms : 57 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 24 ~; 19 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 49 !; 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(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( theorem(X0)
| ~ axiom(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(p,q),or(not(p),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,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(p),q))),not(or(not(or(not(p),q)),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6]) ).
fof(f15,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f17,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f18,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f21,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| ~ theorem(X1)
| theorem(X0) ),
inference(resolution,[],[f19,f7]) ).
fof(f23,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f21,f18]) ).
fof(f24,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f21,f16]) ).
fof(f25,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f21,f15]) ).
fof(f30,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(X1)))
| theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f24,f19]) ).
fof(f34,plain,
! [X0,X1] :
( ~ axiom(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(X0) ),
inference(resolution,[],[f30,f7]) ).
fof(f43,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f25,f23]) ).
fof(f54,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f43,f7]) ).
fof(f60,plain,
! [X0] :
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ),
inference(resolution,[],[f34,f18]) ).
fof(f67,plain,
~ theorem(or(not(or(not(p),q)),or(not(p),q))),
inference(resolution,[],[f60,f13]) ).
fof(f91,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f54,f17]) ).
fof(f112,definition,
( spl0_5
<=> ! [X1] : theorem(or(not(X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f113,plain,
( ! [X1] : theorem(or(not(X1),X1))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f174,plain,
spl0_5,
inference(avatar_split_clause,[],[f91,f112]) ).
fof(f178,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f113,f67]) ).
fof(f185,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f178]) ).
cnf(s7,plain,
spl0_5,
inference(sat_conversion,[],[f174]) ).
cnf(s9,plain,
~ spl0_5,
inference(sat_conversion,[],[f185]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s7,s9]) ).
fof(f186,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL294-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.46 % Computer : n016.cluster.edu
% 0.22/0.46 % Model : x86_64 x86_64
% 0.22/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.46 % Memory : 8046.5625MB
% 0.22/0.46 % OS : Linux 6.8.0-71-generic
% 0.22/0.46 % CPULimit : 300
% 0.22/0.46 % WCLimit : 300
% 0.22/0.46 % DateTime : Sun Sep 27 15:38:17 UTC 2026
% 0.22/0.47 % CPUTime :
% 0.22/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
% 0.30/2.06 % (2794004)Input is clausal, will run a generic CNF schedule.
% 0.30/2.06 % (2794013)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2137381993:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.30/2.06 % (2794013)First to succeed.
% 0.30/2.06 % (2794013)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2794004"
% 0.30/2.06 % (2794010)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2481705083:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.30/2.06 % (2794009)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=388538103:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.30/2.06 % (2794011)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3544837168:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.30/2.06 % (2794012)lrs+10_1_sil=8000:sp=occurrence:random_seed=1041954688:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.30/2.06 % (2794014)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3490856297:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.30/2.06 % (2794015)dis-21_1_sil=8000:lcm=predicate:random_seed=3900626665: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)
% 0.30/2.06 % (2794012)Also succeeded, but the first one will report.
% 0.30/2.06 % (2794014)Also succeeded, but the first one will report.
% 0.30/2.06 % (2794015)Instruction limit reached!
% 0.30/2.06 % (2794015)------------------------------
% 0.30/2.06 % (2794015)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.30/2.06 % (2794015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/2.06 % (2794015)CaDiCaL version: 2.1.3
% 0.30/2.06 % (2794015)Termination reason: Instruction limit
% 0.30/2.06 % (2794015)Termination phase: Saturation
% 0.30/2.06 % (2794015)Time elapsed: 0.091 s
% 0.30/2.06 % (2794015)Peak memory usage: 87 MB
% 0.30/2.06 % (2794015)Instructions burned: 117 (million)
% 0.30/2.06 % (2794013)Refutation found. Thanks to Tanya!
% 0.30/2.06 % SZS status Unsatisfiable for theBenchmark
% 0.30/2.06 % SZS output start Proof for theBenchmark
% See solution above
% 0.30/2.06 % (2794013)------------------------------
% 0.30/2.06 % (2794013)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.30/2.06 % (2794013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/2.06 % (2794013)CaDiCaL version: 2.1.3
% 0.30/2.06 % (2794013)Termination reason: Refutation
% 0.30/2.06 % (2794013)Time elapsed: 0.005 s
% 0.30/2.06 % (2794013)Peak memory usage: 89 MB
% 0.30/2.06 % (2794013)Instructions burned: 5 (million)
% 0.30/2.06 % (2794013)------------------------------
% 0.30/2.06 % (2794013)------------------------------
% 0.30/2.06 % (2794004)Success in time 0.467 s
% 0.30/2.06 % Vampire exiting
%------------------------------------------------------------------------------