%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:58:48 AM UTC 2026
% Result : Theorem 0.22s 0.49s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 4 |; 0 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
( or_2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f45,conjecture,
or_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(f46,negated_conjecture,
~ or_2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ or_2,
inference(flattening,[],[f46]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
=> or_2 ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f59,plain,
( or_2
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f72,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| or_2 ),
inference(cnf_transformation,[],[f59]) ).
fof(f74,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f88,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f96,plain,
~ or_2,
inference(cnf_transformation,[],[f47]) ).
fof(f105,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f74,f88]) ).
fof(f107,plain,
~ is_a_theorem(implies(sK1,or(sK0,sK1))),
inference(forward_subsumption_resolution,[],[f72,f96]) ).
fof(f112,plain,
$false,
inference(forward_subsumption_resolution,[],[f107,f105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 % Computer : n006.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Sun Sep 27 15:50:10 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.45 Running first-order model finding
% 0.13/0.45 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 % (3128864)Will run a generic schedule for satisfiability detection.
% 0.22/0.49 % (3128869)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1003803181_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.49 % TRYING [1]
% 0.22/0.49 % TRYING [2]
% 0.22/0.49 % TRYING [3]
% 0.22/0.49 % (3128873)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4263331519:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.49 % (3128873) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3128864-3128873"...
% 0.22/0.49 % (3128873)...printing done.
% 0.22/0.49 % (3128870)% WARNING: option uhcvi not known.
% 0.22/0.49 % (3128873)Refutation found. Thanks to Tanya!
% 0.22/0.49 % SZS status Theorem for theBenchmark
% 0.22/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.49 % (3128873)------------------------------
% 0.22/0.49 % (3128873)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.49 % (3128873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.49 % (3128873)CaDiCaL version: 2.1.3
% 0.22/0.49 % (3128873)Termination reason: Refutation
% 0.22/0.49 % (3128873)Time elapsed: 0.002 s
% 0.22/0.49 % (3128873)Peak memory usage: 12 MB
% 0.22/0.49 % (3128873)Instructions burned: 1 (million)
% 0.22/0.49 % (3128864)Success in time 0.029 s
% 0.22/0.49 % Vampire exiting
%------------------------------------------------------------------------------