%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL460+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 : n012.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:43 PM UTC 2026
% Result : Theorem 0.08s 5.98s
% Output : CNFRefutation 0.08s
% 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(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
fof(f53,conjecture,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f54,negated_conjecture,
~ kn2,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ kn2,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
=> kn2 ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f65,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f81,plain,
( ~ and_1
| ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f90,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0))
| kn2 ),
inference(ennf_transformation,[],[f56]) ).
fof(f94,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| kn2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f90]) ).
fof(f101,plain,
! [X0,X1] :
( ~ and_1
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| kn2 ),
inference(cnf_transformation,[],[f94]) ).
fof(f122,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f135,plain,
~ kn2,
inference(cnf_transformation,[],[f55]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f101]) ).
tcf(c_64,plain,
( kn2
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_76,plain,
and_1,
inference(cnf_transformation,[],[f122]) ).
tcf(c_89,negated_conjecture,
~ kn2,
inference(cnf_transformation,[],[f135]) ).
tcf(c_107,plain,
~ is_a_theorem(implies(and(sK0,sK1),sK0)),
inference(global_subsumption_just,[status(thm)],[c_64,c_89,c_64]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_55,c_76,c_55]) ).
tcf(c_205,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_107,c_117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL460+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/5.32 % Computer : n012.cluster.edu
% 0.04/5.32 % Model : x86_64 x86_64
% 0.04/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.32 % Memory : 8046.5625MB
% 0.04/5.32 % OS : Linux 6.8.0-71-generic
% 0.04/5.32 % CPULimit : 300
% 0.04/5.32 % WCLimit : 300
% 0.04/5.32 % DateTime : Wed Sep 23 23:27:44 UTC 2026
% 0.04/5.32 % CPUTime :
% 0.04/5.32 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/5.35 Running first-order theorem proving
% 0.04/5.35 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.04/5.35
% 0.04/5.35 % ======== iProver multi-core TPTP/SMT =========
% 0.04/5.35
% 0.04/5.35 % Detected problem language: tptp
% 0.04/5.36 % Proving...
% 0.08/5.98 % SZS status Started for theBenchmark.p
% 0.08/5.98 % SZS status Theorem for theBenchmark.p
% 0.08/5.98
% 0.08/5.98 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.08/5.98
% 0.08/5.98 % ------ iProver source info
% 0.08/5.98
% 0.08/5.98 % git: date: 2026-07-19 20:42:38 +0200
% 0.08/5.98 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.08/5.98 % git: non_committed_changes: false
% 0.08/5.98
% 0.08/5.98 % ------ Parsing...
% 0.08/5.98 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.08/5.98
% 0.08/5.98 % ------ Preprocessing...%
% 0.08/5.98
% 0.08/5.98 % SZS status Theorem for theBenchmark.p
% 0.08/5.98
% 0.08/5.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.08/5.98
% 0.08/5.98
%------------------------------------------------------------------------------