%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL041-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.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:05:29 PM UTC 2026
% Result : Unsatisfiable 4.05s 1.51s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 18 unt; 3 def)
% Number of atoms : 46 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f4,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).
fof(f6,axiom,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).
fof(f7,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_30) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_86,definition,
iPr_def_10 = implies(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_87,definition,
iPr_def_11 = implies(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_88,definition,
iPr_def_12 = implies(iPr_def_11,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_89,negated_conjecture,
~ is_a_theorem(iPr_def_12),
inference(demodulation,[status(thm)],[c_62,c_86,c_87,c_88]) ).
tcf(c_214,plain,
is_a_theorem(implies(iPr_def_11,implies(implies(not(a),iPr_def_10),iPr_def_10))),
inference(superposition,[status(thm)],[c_87,c_61]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_59,c_56]) ).
tcf(c_439,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_57,c_226]) ).
tcf(c_447,plain,
is_a_theorem(implies(implies(not(a),iPr_def_10),implies(iPr_def_11,iPr_def_10))),
inference(superposition,[status(thm)],[c_214,c_226]) ).
tcf(c_466,plain,
is_a_theorem(implies(implies(not(a),iPr_def_10),iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_447,c_88]) ).
tcf(c_531,plain,
is_a_theorem(implies(not(a),iPr_def_10)),
inference(superposition,[status(thm)],[c_86,c_439]) ).
tcf(c_544,plain,
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(not(a),iPr_def_10)) ),
inference(superposition,[status(thm)],[c_466,c_56]) ).
tcf(c_545,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_544,c_89,c_531]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL041-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.44 % Computer : n008.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Wed Sep 23 21:42:55 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.49 Running first-order theorem proving
% 0.18/0.49 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.25/0.51
% 0.25/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.25/0.51
% 0.25/0.51 % Detected problem language: tptp
% 0.25/0.53 % Proving...
% 4.05/1.51 % SZS status Started for theBenchmark.p
% 4.05/1.51 % SZS status Unsatisfiable for theBenchmark.p
% 4.05/1.51
% 4.05/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.05/1.51
% 4.05/1.51 % ------ iProver source info
% 4.05/1.51
% 4.05/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 4.05/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.05/1.51 % git: non_committed_changes: false
% 4.05/1.51
% 4.05/1.51 % ------ Parsing...% successful
% 4.05/1.51
% 4.05/1.51
% 4.05/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.05/1.51
% 4.05/1.51 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.05/1.51
% 4.05/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.05/1.51
% 4.05/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.05/1.51 % ------ Proving...
% 4.05/1.51 % ------ Problem Properties
% 4.05/1.51
% 4.05/1.51 %
% 4.05/1.51 % clauses 10
% 4.05/1.51 % conjectures 1
% 4.05/1.51 % EPR 1
% 4.05/1.51 % Horn 10
% 4.05/1.51 % unary 9
% 4.05/1.51 % binary 0
% 4.05/1.51 % lits 12
% 4.05/1.51 % lits eq 3
% 4.05/1.51 % fd_pure 0
% 4.05/1.51 % fd_pseudo 0
% 4.05/1.51 % fd_cond 0
% 4.05/1.51 % fd_pseudo_cond 0
% 4.05/1.51 % AC symbols 0
% 4.05/1.51
% 4.05/1.51 % ------ Schedule dynamic 5 is on
% 4.05/1.51
% 4.05/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.51
% 4.05/1.51
% 4.05/1.51 % ------
% 4.05/1.51 % Current options:
% 4.05/1.51 % ------
% 4.05/1.51
% 4.05/1.51
% 4.05/1.51 %
% 4.05/1.51
% 4.05/1.51 % ------ Proving...
% 4.05/1.51 %
% 4.05/1.51
% 4.05/1.51 % SZS status Unsatisfiable for theBenchmark.p
% 4.05/1.51
% 4.05/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.51
% 4.05/1.51
%------------------------------------------------------------------------------