%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL219-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:51:37 AM UTC 2026
% Result : Unsatisfiable 3.30s 1.45s
% Output : Refutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 20 unt; 0 def)
% Number of atoms : 39 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(implies(implies(p,q),q),or(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
~ theorem(or(not(or(not(or(not(p),q)),q)),or(p,q))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f11,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(f12,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f16,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f19,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f24,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f12,f7]) ).
fof(f26,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f11,f7]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f24,f16]) ).
fof(f35,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f26,f16]) ).
fof(f53,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f29,f26]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f35,f16]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f56,f19]) ).
fof(f130,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f53,f16]) ).
fof(f311,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f101,f17]) ).
fof(f356,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[],[f311,f29]) ).
fof(f418,plain,
~ theorem(or(p,or(not(p),q))),
inference(resolution,[],[f130,f10]) ).
fof(f427,plain,
$false,
inference(forward_subsumption_resolution,[],[f418,f356]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL219-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:30:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.30/1.45 % (1787657)Input is clausal, will run a generic CNF schedule.
% 3.30/1.45 % (1787730)lrs+10_1_sil=8000:sp=occurrence:random_seed=3044967186:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.30/1.45 % (1787730)First to succeed.
% 3.30/1.45 % (1787730)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1787657"
% 3.30/1.45 % (1787729)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3968520084:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.30/1.45 % (1787728)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1987259313:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.30/1.45 % (1787727)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=1408746914:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.30/1.45 % (1787733)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3956367012:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.30/1.45 % (1787731)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2326132973:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.30/1.45 % (1787734)dis-21_1_sil=8000:lcm=predicate:random_seed=2375265578: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)
% 3.30/1.45 % (1787734)Instruction limit reached!
% 3.30/1.45 % (1787734)------------------------------
% 3.30/1.45 % (1787734)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.45 % (1787734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.45 % (1787734)CaDiCaL version: 2.1.3
% 3.30/1.45 % (1787734)Termination reason: Instruction limit
% 3.30/1.45 % (1787734)Termination phase: Saturation
% 3.30/1.45 % (1787734)Time elapsed: 0.100 s
% 3.30/1.45 % (1787734)Peak memory usage: 87 MB
% 3.30/1.45 % (1787734)Instructions burned: 117 (million)
% 3.30/1.45 % (1787731)Instruction limit reached!
% 3.30/1.45 % (1787731)------------------------------
% 3.30/1.45 % (1787731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.45 % (1787731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.45 % (1787731)CaDiCaL version: 2.1.3
% 3.30/1.45 % (1787731)Termination reason: Instruction limit
% 3.30/1.45 % (1787731)Termination phase: Saturation
% 3.30/1.45 % (1787731)Time elapsed: 0.102 s
% 3.30/1.45 % (1787731)Peak memory usage: 87 MB
% 3.30/1.45 % (1787731)Instructions burned: 115 (million)
% 3.30/1.45 % (1787730)Refutation found. Thanks to Tanya!
% 3.30/1.45 % SZS status Unsatisfiable for theBenchmark
% 3.30/1.45 % SZS output start Proof for theBenchmark
% See solution above
% 3.30/1.45 % (1787730)------------------------------
% 3.30/1.45 % (1787730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.45 % (1787730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.45 % (1787730)CaDiCaL version: 2.1.3
% 3.30/1.45 % (1787730)Termination reason: Refutation
% 3.30/1.45 % (1787730)Time elapsed: 0.005 s
% 3.30/1.45 % (1787730)Peak memory usage: 88 MB
% 3.30/1.45 % (1787730)Instructions burned: 13 (million)
% 3.30/1.45 % (1787730)------------------------------
% 3.30/1.45 % (1787730)------------------------------
% 3.30/1.45 % (1787657)Success in time 0.379 s
% 3.30/1.46 % Vampire exiting
%------------------------------------------------------------------------------