%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:43 AM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 17 unt; 0 def)
% Number of atoms : 47 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 29 ( 14 ~; 9 |; 0 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(f20,axiom,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(f53,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f54,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ cn2,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f62,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f85,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f62]) ).
fof(f91,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f56]) ).
fof(f92,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f93,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f95,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f91]) ).
fof(f105,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f85]) ).
fof(f111,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f95]) ).
fof(f112,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f92]) ).
fof(f113,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f93]) ).
fof(f115,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f116,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f126,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f135,plain,
~ cn2,
inference(cnf_transformation,[],[f55]) ).
fof(f137,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(global_subsumption,[],[f113,f116]) ).
fof(f138,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(global_subsumption,[],[f112,f115]) ).
fof(f139,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(global_subsumption,[],[f111,f135]) ).
fof(f145,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(global_subsumption,[],[f105,f126]) ).
fof(f332,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f138,f137]) ).
fof(f335,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(superposition,[],[f139,f332]) ).
fof(f348,plain,
$false,
inference(forward_subsumption_resolution,[],[f335,f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:45:01 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.11/0.45 % (964167)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (964174)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3404280227:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (964174) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-964167-964174"...
% 0.11/0.45 % (964173)% WARNING: option uhcvi not known.
% 0.11/0.45 % (964174)...printing done.
% 0.11/0.45 % (964174)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (964174)------------------------------
% 0.11/0.45 % (964174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (964174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (964174)CaDiCaL version: 2.1.3
% 0.11/0.45 % (964174)Termination reason: Refutation
% 0.11/0.45 % (964174)Time elapsed: 0.003 s
% 0.11/0.45 % (964174)Peak memory usage: 12 MB
% 0.11/0.45 % (964174)Instructions burned: 7 (million)
% 0.11/0.45 % (964167)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------