%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL189-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:57:54 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(or(not(p),or(not(or(not(p),q)),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f2,f6]) ).
fof(f13,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f7,f1]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f4,f7]) ).
fof(f20,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f5,f7]) ).
fof(f38,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f16,f11]) ).
fof(f47,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f20,f16]) ).
fof(f55,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f38,f13]) ).
fof(f109,plain,
~ theorem(or(not(q),q)),
inference(resolution,[],[f47,f9]) ).
fof(f113,plain,
$false,
inference(forward_subsumption_resolution,[],[f109,f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL189-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:31:47 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.45 % (3716542)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3716550)dis+10_1_sil=32000:sp=arity:random_seed=3576852933:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3716550) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3716542-3716550"...
% 0.10/0.45 % (3716550)...printing done.
% 0.10/0.45 % (3716550)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (3716550)------------------------------
% 0.10/0.45 % (3716550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3716550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3716550)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3716550)Termination reason: Refutation
% 0.10/0.45 % (3716550)Time elapsed: 0.002 s
% 0.10/0.45 % (3716550)Peak memory usage: 11 MB
% 0.10/0.45 % (3716550)Instructions burned: 3 (million)
% 0.10/0.45 % (3716542)Success in time 0.024 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------