%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL043-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 : n011.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 2.63s 16.36s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 27 unt; 3 def)
% Number of atoms : 70 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 33 :)
% 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(f3,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
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(f5,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_22) ).
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(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
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_58,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
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_60,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(cnf_transformation,[],[f5]) ).
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(not(not(a)),a)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_86,definition,
iPr_def_10 = not(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_87,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_88,definition,
iPr_def_12 = implies(iPr_def_11,a),
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_200,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_10,implies(iPr_def_11,X0))),
inference(superposition,[status(thm)],[c_87,c_57]) ).
tcf(c_222,plain,
! [X0: $i] : is_a_theorem(implies(implies(a,X0),implies(implies(iPr_def_10,X0),X0))),
inference(superposition,[status(thm)],[c_86,c_61]) ).
tcf(c_232,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_239,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,a),implies(implies(iPr_def_11,X0),iPr_def_12))),
inference(superposition,[status(thm)],[c_88,c_60]) ).
tcf(c_282,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_10,X0),X0))
| ~ is_a_theorem(implies(a,X0)) ),
inference(superposition,[status(thm)],[c_222,c_56]) ).
tcf(c_285,plain,
( is_a_theorem(implies(implies(iPr_def_10,a),a))
| ~ is_a_theorem(implies(a,a)) ),
inference(instantiation,[status(thm)],[c_282]) ).
tcf(c_369,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_12))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_239,c_56]) ).
tcf(c_441,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_57,c_232]) ).
tcf(c_442,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_58,c_232]) ).
tcf(c_447,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_200,c_232]) ).
tcf(c_533,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_442,c_56]) ).
tcf(c_581,plain,
! [X0: $i] : is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_441,c_533]) ).
tcf(c_584,plain,
is_a_theorem(implies(a,a)),
inference(instantiation,[status(thm)],[c_581]) ).
tcf(c_710,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_369,c_56]) ).
tcf(c_711,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_710,c_89]) ).
tcf(c_763,plain,
! [X0: $i] : ~ is_a_theorem(implies(implies(iPr_def_10,X0),a)),
inference(superposition,[status(thm)],[c_447,c_711]) ).
tcf(c_771,plain,
~ is_a_theorem(implies(implies(iPr_def_10,a),a)),
inference(instantiation,[status(thm)],[c_763]) ).
tcf(c_772,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_771,c_584,c_285]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/15.43 % CPULimit : 300
% 0.10/15.43 % WCLimit : 300
% 0.10/15.43 % DateTime : Wed Sep 23 21:42:44 UTC 2026
% 0.10/15.44 % CPUTime :
% 0.10/15.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/15.48 Running first-order theorem proving
% 0.10/15.48 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/15.49
% 0.10/15.49 % ======== iProver multi-core TPTP/SMT =========
% 0.10/15.49
% 0.10/15.49 % Detected problem language: tptp
% 0.35/15.50 % Proving...
% 2.63/16.36 % SZS status Started for theBenchmark.p
% 2.63/16.36 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/16.36
% 2.63/16.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.63/16.36
% 2.63/16.36 % ------ iProver source info
% 2.63/16.36
% 2.63/16.36 % git: date: 2026-07-19 20:42:38 +0200
% 2.63/16.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.63/16.36 % git: non_committed_changes: false
% 2.63/16.36
% 2.63/16.36 % ------ Parsing...% successful
% 2.63/16.36
% 2.63/16.36
% 2.63/16.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.63/16.36
% 2.63/16.36 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.63/16.36
% 2.63/16.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.63/16.36
% 2.63/16.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.63/16.36 % ------ Proving...
% 2.63/16.36 % ------ Problem Properties
% 2.63/16.36
% 2.63/16.36 %
% 2.63/16.36 % clauses 10
% 2.63/16.36 % conjectures 1
% 2.63/16.36 % EPR 1
% 2.63/16.36 % Horn 10
% 2.63/16.36 % unary 9
% 2.63/16.36 % binary 0
% 2.63/16.36 % lits 12
% 2.63/16.36 % lits eq 3
% 2.63/16.36 % fd_pure 0
% 2.63/16.36 % fd_pseudo 0
% 2.63/16.36 % fd_cond 0
% 2.63/16.36 % fd_pseudo_cond 0
% 2.63/16.36 % AC symbols 0
% 2.63/16.36
% 2.63/16.36 % ------ Schedule dynamic 5 is on
% 2.63/16.36
% 2.63/16.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.63/16.36
% 2.63/16.36
% 2.63/16.36 % ------
% 2.63/16.36 % Current options:
% 2.63/16.36 % ------
% 2.63/16.36
% 2.63/16.36
% 2.63/16.36 %
% 2.63/16.36
% 2.63/16.36 % ------ Proving...
% 2.63/16.36 %
% 2.63/16.36
% 2.63/16.36 % SZS status Unsatisfiable for theBenchmark.p
% 2.63/16.36
% 2.63/16.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.63/16.36
% 2.63/16.36
%------------------------------------------------------------------------------