%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL484+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 : n005.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:45 PM UTC 2026
% Result : Theorem 1.89s 1.28s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 46 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 10 |; 0 &)
% ( 2 <=>; 3 =>; 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 : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 28 !; 2 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
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(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f45,conjecture,
implies_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f46,negated_conjecture,
~ implies_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ implies_1,
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(X0,implies(X1,X0)))
=> implies_1 ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f59,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,X0)))
| implies_1 ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ~ r2
| ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f51]) ).
fof(f68,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f70,plain,
( ~ is_a_theorem(implies(sK0,implies(sK1,sK0)))
| implies_1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f73,plain,
( ~ is_a_theorem(implies(sK0,implies(sK1,sK0)))
| implies_1 ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f82,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f97,plain,
~ implies_1,
inference(cnf_transformation,[],[f47]) ).
tcf(c_51,plain,
( implies_1
| ~ is_a_theorem(implies(sK0,implies(sK1,sK0))) ),
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_60,plain,
! [X0: $i,X1: $i] :
( ( or(not(X0),X1) = implies(X0,X1) )
| ~ op_implies_or ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_62,plain,
op_implies_or,
inference(cnf_transformation,[],[f84]) ).
tcf(c_67,plain,
r2,
inference(cnf_transformation,[],[f89]) ).
tcf(c_75,negated_conjecture,
~ implies_1,
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(sK0,implies(sK1,sK0))),
inference(global_subsumption_just,[status(thm)],[c_51,c_75,c_51]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] : or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_60,c_62,c_60]) ).
tcf(c_404,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_98,c_87]) ).
tcf(c_406,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_93,c_404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL484+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.09/0.37 % Computer : n005.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 23:31:47 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.89/1.28 % SZS status Started for theBenchmark.p
% 1.89/1.28 % SZS status Theorem for theBenchmark.p
% 1.89/1.28
% 1.89/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.89/1.28
% 1.89/1.28 % ------ iProver source info
% 1.89/1.28
% 1.89/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.89/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.89/1.28 % git: non_committed_changes: false
% 1.89/1.28
% 1.89/1.28 % ------ Parsing...
% 1.89/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.89/1.28
% 1.89/1.28 % ------ Preprocessing... sup_sim: 2 sf_s rm: 14 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.89/1.28
% 1.89/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.89/1.28
% 1.89/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.89/1.28 % ------ Proving...
% 1.89/1.28 % ------ Problem Properties
% 1.89/1.28
% 1.89/1.28 %
% 1.89/1.28 % clauses 13
% 1.89/1.28 % conjectures 0
% 1.89/1.28 % EPR 0
% 1.89/1.28 % Horn 13
% 1.89/1.28 % unary 11
% 1.89/1.28 % binary 1
% 1.89/1.28 % lits 16
% 1.89/1.28 % lits eq 6
% 1.89/1.28 % fd_pure 0
% 1.89/1.28 % fd_pseudo 0
% 1.89/1.28 % fd_cond 0
% 1.89/1.28 % fd_pseudo_cond 1
% 1.89/1.28 % AC symbols 0
% 1.89/1.28
% 1.89/1.28 % ------ Schedule dynamic 5 is on
% 1.89/1.28
% 1.89/1.28 % ------ no conjectures: strip conj schedule
% 1.89/1.28
% 1.89/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.89/1.28
% 1.89/1.28
% 1.89/1.28 % ------
% 1.89/1.28 % Current options:
% 1.89/1.28 % ------
% 1.89/1.28
% 1.89/1.28
% 1.89/1.28 %
% 1.89/1.28
% 1.89/1.28 % ------ Proving...
% 1.89/1.28 %
% 1.89/1.28
% 1.89/1.28 % SZS status Theorem for theBenchmark.p
% 1.89/1.28
% 1.89/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.89/1.28
% 1.89/1.28
%------------------------------------------------------------------------------