%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:48 PM UTC 2026
% Result : Theorem 1.98s 1.28s
% Output : CNFRefutation 1.98s
% 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(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f43,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(f44,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ equivalence_1,
inference(flattening,[],[f44]) ).
fof(f47,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f57,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
| equivalence_1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f59,plain,
( ~ kn2
| ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f63,plain,
( ~ op_equiv
| ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| equivalence_1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f57]) ).
fof(f67,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| equivalence_1 ),
inference(cnf_transformation,[],[f64]) ).
fof(f69,plain,
! [X0,X1] :
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f73,plain,
! [X0,X1] :
( ~ op_equiv
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(cnf_transformation,[],[f63]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f84,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
~ equivalence_1,
inference(cnf_transformation,[],[f45]) ).
tcf(c_51,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) )
| ~ op_equiv ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_63,plain,
kn2,
inference(cnf_transformation,[],[f79]) ).
tcf(c_68,plain,
op_equiv,
inference(cnf_transformation,[],[f84]) ).
tcf(c_69,negated_conjecture,
~ equivalence_1,
inference(cnf_transformation,[],[f85]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_53,c_63,c_53]) ).
tcf(c_83,plain,
~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_51,c_69,c_51]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] : and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_57,c_68,c_57]) ).
tcf(c_389,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))),
inference(superposition,[status(thm)],[c_96,c_77]) ).
tcf(c_390,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_83,c_389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n002.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:39:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/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.98/1.28 % SZS status Started for theBenchmark.p
% 1.98/1.28 % SZS status Theorem for theBenchmark.p
% 1.98/1.28
% 1.98/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.98/1.28
% 1.98/1.28 % ------ iProver source info
% 1.98/1.28
% 1.98/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.98/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.98/1.28 % git: non_committed_changes: false
% 1.98/1.28
% 1.98/1.28 % ------ Parsing...
% 1.98/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.98/1.28
% 1.98/1.28 % ------ Preprocessing... sup_sim: 2 sf_s rm: 10 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.98/1.28
% 1.98/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.98/1.28
% 1.98/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.98/1.28 % ------ Proving...
% 1.98/1.28 % ------ Problem Properties
% 1.98/1.28
% 1.98/1.28 %
% 1.98/1.28 % clauses 9
% 1.98/1.28 % conjectures 0
% 1.98/1.28 % EPR 0
% 1.98/1.28 % Horn 9
% 1.98/1.28 % unary 7
% 1.98/1.28 % binary 1
% 1.98/1.28 % lits 12
% 1.98/1.28 % lits eq 4
% 1.98/1.28 % fd_pure 0
% 1.98/1.28 % fd_pseudo 0
% 1.98/1.28 % fd_cond 0
% 1.98/1.28 % fd_pseudo_cond 1
% 1.98/1.28 % AC symbols 0
% 1.98/1.28
% 1.98/1.28 % ------ Schedule dynamic 5 is on
% 1.98/1.28
% 1.98/1.28 % ------ no conjectures: strip conj schedule
% 1.98/1.28
% 1.98/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.98/1.28
% 1.98/1.28
% 1.98/1.28 % ------
% 1.98/1.28 % Current options:
% 1.98/1.28 % ------
% 1.98/1.28
% 1.98/1.28
% 1.98/1.28 %
% 1.98/1.28
% 1.98/1.28 % ------ Proving...
% 1.98/1.28 %
% 1.98/1.28
% 1.98/1.28 % SZS status Theorem for theBenchmark.p
% 1.98/1.28
% 1.98/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.98/1.28
% 1.98/1.28
%------------------------------------------------------------------------------