%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL044-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 : n009.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.43s 1.29s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 20 unt; 3 def)
% Number of atoms : 59 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 21 ( 12 ~; 9 |; 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 : 28 ( 0 sgn 28 !; 0 ?; 17 :)
% 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(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(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_40) ).
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_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(a,not(not(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(a,iPr_def_11),
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_198,plain,
is_a_theorem(implies(iPr_def_11,iPr_def_12)),
inference(superposition,[status(thm)],[c_88,c_58]) ).
tcf(c_199,plain,
! [X0: $i] : is_a_theorem(implies(a,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_86,c_57]) ).
tcf(c_227,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_10,X0),implies(implies(iPr_def_11,X0),X0))),
inference(superposition,[status(thm)],[c_87,c_61]) ).
tcf(c_236,plain,
! [X0: $i] : is_a_theorem(implies(implies(a,implies(X0,iPr_def_11)),implies(X0,iPr_def_12))),
inference(superposition,[status(thm)],[c_88,c_59]) ).
tcf(c_313,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_11,X0),X0))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_227,c_56]) ).
tcf(c_339,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_12))
| ~ is_a_theorem(implies(a,implies(X0,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_236,c_56]) ).
tcf(c_409,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_313,c_56]) ).
tcf(c_429,plain,
is_a_theorem(implies(iPr_def_10,iPr_def_12)),
inference(superposition,[status(thm)],[c_199,c_339]) ).
tcf(c_1004,plain,
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(iPr_def_10,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_198,c_409]) ).
tcf(c_1010,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1004,c_89,c_429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL044-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.09/0.37 % Computer : n009.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 21:42:45 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 2.43/1.29 % SZS status Started for theBenchmark.p
% 2.43/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.43/1.29
% 2.43/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.43/1.29
% 2.43/1.29 % ------ iProver source info
% 2.43/1.29
% 2.43/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.43/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.43/1.29 % git: non_committed_changes: false
% 2.43/1.29
% 2.43/1.29 % ------ Parsing...% successful
% 2.43/1.29
% 2.43/1.29
% 2.43/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.43/1.29
% 2.43/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.43/1.29
% 2.43/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.43/1.29
% 2.43/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.43/1.29 % ------ Proving...
% 2.43/1.29 % ------ Problem Properties
% 2.43/1.29
% 2.43/1.29 %
% 2.43/1.29 % clauses 10
% 2.43/1.29 % conjectures 1
% 2.43/1.29 % EPR 1
% 2.43/1.29 % Horn 10
% 2.43/1.29 % unary 9
% 2.43/1.29 % binary 0
% 2.43/1.29 % lits 12
% 2.43/1.29 % lits eq 3
% 2.43/1.29 % fd_pure 0
% 2.43/1.29 % fd_pseudo 0
% 2.43/1.29 % fd_cond 0
% 2.43/1.29 % fd_pseudo_cond 0
% 2.43/1.29 % AC symbols 0
% 2.43/1.29
% 2.43/1.29 % ------ Schedule dynamic 5 is on
% 2.43/1.29
% 2.43/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.43/1.29
% 2.43/1.29
% 2.43/1.29 % ------
% 2.43/1.29 % Current options:
% 2.43/1.29 % ------
% 2.43/1.29
% 2.43/1.29
% 2.43/1.29 %
% 2.43/1.29
% 2.43/1.29 % ------ Proving...
% 2.43/1.29 %
% 2.43/1.29
% 2.43/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.43/1.29
% 2.43/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.43/1.29
% 2.43/1.29
%------------------------------------------------------------------------------