%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL189-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 : n001.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:29 AM UTC 2026
% Result : Unsatisfiable 0.59s 1.02s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 45 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 32 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 42 ( 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
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] :
( 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,negated_conjecture,
~ theorem(or(not(p),implies(implies(p,q),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
~ theorem(or(not(p),or(not(or(not(p),q)),q))),
inference(definition_unfolding,[],[f9,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(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(f18,plain,
! [X0,X1] :
( theorem(X0)
| ~ theorem(X1)
| ~ axiom(or(not(X1),X0)) ),
inference(resolution,[],[f16,f7]) ).
fof(f19,plain,
! [X0] :
( ~ theorem(X0)
| ~ axiom(or(not(X0),or(not(p),or(not(or(not(p),q)),q)))) ),
inference(resolution,[],[f18,f10]) ).
fof(f20,plain,
! [X2,X0,X1] :
( theorem(X2)
| ~ axiom(or(not(X0),or(not(X1),X2)))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f18,f16]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ theorem(X0)
| ~ theorem(X1)
| ~ axiom(or(not(X0),or(not(X1),X2)))
| ~ axiom(or(not(X2),or(not(p),or(not(or(not(p),q)),q)))) ),
inference(resolution,[],[f20,f19]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X0),or(not(X1),X2)))
| ~ axiom(or(not(X2),or(not(p),or(not(or(not(p),q)),q))))
| ~ axiom(X0) ),
inference(resolution,[],[f25,f7]) ).
fof(f117,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),or(not(X1),X2)))
| ~ axiom(or(not(X2),or(not(p),or(not(or(not(p),q)),q))))
| ~ axiom(X0)
| ~ axiom(X1) ),
inference(resolution,[],[f42,f7]) ).
fof(f550,plain,
! [X0,X1] :
( ~ axiom(or(not(X0),or(not(X1),or(not(or(not(p),q)),or(not(p),q)))))
| ~ axiom(X0)
| ~ axiom(X1) ),
inference(resolution,[],[f117,f12]) ).
fof(f941,plain,
! [X0] :
( ~ axiom(or(not(or(not(p),q)),or(not(X0),or(not(p),q))))
| ~ axiom(X0) ),
inference(resolution,[],[f550,f12]) ).
fof(f956,plain,
! [X0] : ~ axiom(X0),
inference(resolution,[],[f941,f14]) ).
fof(f961,plain,
$false,
inference(resolution,[],[f956,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL189-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:31:46 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.59/1.02 % (3716522)Input is clausal, will run a generic CNF schedule.
% 0.59/1.02 % (3716537)dis-21_1_sil=8000:lcm=predicate:random_seed=4200859909: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.59/1.02 % (3716537)First to succeed.
% 0.59/1.02 % (3716537)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3716522"
% 0.59/1.02 % (3716532)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1534152239:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.59/1.02 % (3716531)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=3035782426:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.59/1.02 % (3716535)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1517787931:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.59/1.02 % (3716533)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2641837737:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.59/1.02 % (3716536)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1547980811:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.59/1.02 % (3716534)lrs+10_1_sil=8000:sp=occurrence:random_seed=2459434935:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.59/1.02 % (3716534)Also succeeded, but the first one will report.
% 0.59/1.02 % (3716536)Also succeeded, but the first one will report.
% 0.59/1.02 % (3716535)Instruction limit reached!
% 0.59/1.02 % (3716535)------------------------------
% 0.59/1.02 % (3716535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.59/1.02 % (3716535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/1.02 % (3716535)CaDiCaL version: 2.1.3
% 0.59/1.02 % (3716535)Termination reason: Instruction limit
% 0.59/1.02 % (3716535)Termination phase: Saturation
% 0.59/1.02 % (3716535)Time elapsed: 0.069 s
% 0.59/1.02 % (3716535)Peak memory usage: 88 MB
% 0.59/1.02 % (3716535)Instructions burned: 115 (million)
% 0.59/1.02 % (3716537)Refutation found. Thanks to Tanya!
% 0.59/1.02 % SZS status Unsatisfiable for theBenchmark
% 0.59/1.02 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/1.02 % (3716537)------------------------------
% 0.59/1.02 % (3716537)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.59/1.02 % (3716537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/1.02 % (3716537)CaDiCaL version: 2.1.3
% 0.59/1.02 % (3716537)Termination reason: Refutation
% 0.59/1.02 % (3716537)Time elapsed: 0.015 s
% 0.59/1.02 % (3716537)Peak memory usage: 88 MB
% 0.59/1.02 % (3716537)Instructions burned: 52 (million)
% 0.59/1.02 % (3716537)------------------------------
% 0.59/1.02 % (3716537)------------------------------
% 0.59/1.02 % (3716522)Success in time 0.314 s
% 0.59/1.02 % Vampire exiting
%------------------------------------------------------------------------------