%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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 : Fri Sep 25 02:06:46 PM UTC 2026
% Result : Theorem 1.32s 1.27s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 0 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 18 ( 0 sgn 16 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
( or_2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f45,conjecture,
or_2,
file('/export/starexec/sandbox/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,
( ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1)))
| or_2 ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ~ r2
| ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f51]) ).
fof(f70,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| or_2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f73,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| or_2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f97,plain,
~ or_2,
inference(cnf_transformation,[],[f47]) ).
tcf(c_51,plain,
( or_2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_67,plain,
r2,
inference(cnf_transformation,[],[f89]) ).
tcf(c_75,negated_conjecture,
~ or_2,
inference(cnf_transformation,[],[f97]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_53,c_67,c_53]) ).
tcf(c_93,plain,
~ is_a_theorem(implies(sK1,or(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_51,c_75,c_51]) ).
tcf(c_152,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_93,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 23:31:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.32/1.27 % SZS status Started for theBenchmark.p
% 1.32/1.27 % SZS status Theorem for theBenchmark.p
% 1.32/1.27
% 1.32/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.32/1.27
% 1.32/1.27 % ------ iProver source info
% 1.32/1.27
% 1.32/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.32/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.32/1.27 % git: non_committed_changes: false
% 1.32/1.27
% 1.32/1.27 % ------ Parsing...
% 1.32/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.32/1.27
% 1.32/1.27 % ------ Preprocessing...%
% 1.32/1.27
% 1.32/1.27 % SZS status Theorem for theBenchmark.p
% 1.32/1.27
% 1.32/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.32/1.27
% 1.32/1.27
%------------------------------------------------------------------------------