%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL527+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 : n017.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:50 PM UTC 2026
% Result : Theorem 3.73s 1.51s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 92 ( 36 ~; 36 |; 10 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 35 !; 4 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(f52,axiom,
( adjunction
<=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',adjunction) ).
fof(f88,conjecture,
adjunction,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f89,negated_conjecture,
~ adjunction,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ adjunction,
inference(flattening,[],[f89]) ).
fof(f94,plain,
( ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) )
=> adjunction ),
inference(unused_predicate_definition_removal,[],[f52]) ).
fof(f102,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f110,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f115,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(ennf_transformation,[],[f110]) ).
fof(f116,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(flattening,[],[f115]) ).
fof(f124,plain,
( ~ and_3
| ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(ennf_transformation,[],[f102]) ).
fof(f135,plain,
( ? [X0,X1] :
( is_a_theorem(X1)
& is_a_theorem(X0)
& ~ is_a_theorem(and(X0,X1)) )
| adjunction ),
inference(ennf_transformation,[],[f94]) ).
fof(f136,plain,
( ? [X0,X1] :
( is_a_theorem(X1)
& is_a_theorem(X0)
& ~ is_a_theorem(and(X0,X1)) )
| adjunction ),
inference(flattening,[],[f135]) ).
fof(f143,plain,
( ( is_a_theorem(sK1)
& is_a_theorem(sK0)
& ~ is_a_theorem(and(sK0,sK1)) )
| adjunction ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f136]) ).
fof(f144,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f152,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f124]) ).
fof(f165,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f172,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f181,plain,
( is_a_theorem(sK1)
| adjunction ),
inference(cnf_transformation,[],[f143]) ).
fof(f182,plain,
( is_a_theorem(sK0)
| adjunction ),
inference(cnf_transformation,[],[f143]) ).
fof(f183,plain,
( ~ is_a_theorem(and(sK0,sK1))
| adjunction ),
inference(cnf_transformation,[],[f143]) ).
fof(f200,plain,
~ adjunction,
inference(cnf_transformation,[],[f90]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_70,plain,
modus_ponens,
inference(cnf_transformation,[],[f165]) ).
tcf(c_77,plain,
and_3,
inference(cnf_transformation,[],[f172]) ).
tcf(c_86,plain,
( adjunction
| ~ is_a_theorem(and(sK0,sK1)) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_87,plain,
( adjunction
| is_a_theorem(sK0) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_88,plain,
( adjunction
| is_a_theorem(sK1) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_105,negated_conjecture,
~ adjunction,
inference(cnf_transformation,[],[f200]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(global_subsumption_just,[status(thm)],[c_57,c_77,c_57]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_70,c_49]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(renaming,[status(thm)],[c_184]) ).
tcf(c_753,plain,
! [X0: $i] :
( is_a_theorem(and(sK0,sK1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,and(sK0,sK1))) ),
inference(instantiation,[status(thm)],[c_185]) ).
tcf(c_759,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,and(sK0,sK1)))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,implies(X1,and(sK0,sK1)))) ),
inference(instantiation,[status(thm)],[c_185]) ).
tcf(c_938,plain,
( is_a_theorem(implies(sK1,and(sK0,sK1)))
| ~ is_a_theorem(sK0)
| ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))) ),
inference(instantiation,[status(thm)],[c_759]) ).
tcf(c_939,plain,
is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))),
inference(instantiation,[status(thm)],[c_166]) ).
tcf(c_1217,plain,
( is_a_theorem(and(sK0,sK1))
| ~ is_a_theorem(sK1)
| ~ is_a_theorem(implies(sK1,and(sK0,sK1))) ),
inference(instantiation,[status(thm)],[c_753]) ).
tcf(c_1218,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1217,c_939,c_938,c_86,c_87,c_88,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n017.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Wed Sep 23 23:34:30 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.53 % Proving...
% 3.73/1.51 % SZS status Started for theBenchmark.p
% 3.73/1.51 % SZS status Theorem for theBenchmark.p
% 3.73/1.51
% 3.73/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.73/1.51
% 3.73/1.51 % ------ iProver source info
% 3.73/1.51
% 3.73/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 3.73/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.73/1.51 % git: non_committed_changes: false
% 3.73/1.51
% 3.73/1.51 % ------ Parsing...
% 3.73/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.73/1.51
% 3.73/1.51 % ------ Preprocessing... sup_sim: 3 sf_s rm: 27 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.73/1.51
% 3.73/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.73/1.51
% 3.73/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.73/1.51 % ------ Proving...
% 3.73/1.51 % ------ Problem Properties
% 3.73/1.51
% 3.73/1.51 %
% 3.73/1.51 % clauses 28
% 3.73/1.51 % conjectures 0
% 3.73/1.51 % EPR 2
% 3.73/1.51 % Horn 28
% 3.73/1.51 % unary 25
% 3.73/1.51 % binary 2
% 3.73/1.51 % lits 32
% 3.73/1.51 % lits eq 7
% 3.73/1.51 % fd_pure 0
% 3.73/1.51 % fd_pseudo 0
% 3.73/1.51 % fd_cond 0
% 3.73/1.51 % fd_pseudo_cond 1
% 3.73/1.51 % AC symbols 0
% 3.73/1.51
% 3.73/1.51 % ------ Schedule dynamic 5 is on
% 3.73/1.51
% 3.73/1.51 % ------ no conjectures: strip conj schedule
% 3.73/1.51
% 3.73/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.73/1.51
% 3.73/1.51
% 3.73/1.51 % ------
% 3.73/1.51 % Current options:
% 3.73/1.51 % ------
% 3.73/1.51
% 3.73/1.51
% 3.73/1.51 %
% 3.73/1.51
% 3.73/1.51 % ------ Proving...
% 3.73/1.51 %
% 3.73/1.51
% 3.73/1.51 % SZS status Theorem for theBenchmark.p
% 3.73/1.51
% 3.73/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.73/1.51
% 3.73/1.51
%------------------------------------------------------------------------------