%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL077-2 : 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 : 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:05:35 PM UTC 2026
% Result : Unsatisfiable 2.51s 1.28s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 24 unt; 3 def)
% Number of atoms : 97 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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 : 40 ( 0 sgn 40 !; 0 ?; 28 :)
% 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(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
fof(f5,axiom,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
tcf(c_55,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_56,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_84,definition,
iPr_def_10 = not(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_85,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_86,definition,
iPr_def_12 = implies(iPr_def_11,a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_87,negated_conjecture,
~ is_a_theorem(iPr_def_12),
inference(demodulation,[status(thm)],[c_60,c_84,c_85,c_86]) ).
tcf(c_220,plain,
is_a_theorem(implies(implies(not(a),not(iPr_def_11)),iPr_def_12)),
inference(superposition,[status(thm)],[c_86,c_58]) ).
tcf(c_222,plain,
is_a_theorem(implies(implies(iPr_def_10,not(iPr_def_11)),iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_220,c_84]) ).
tcf(c_230,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_12),implies(implies(X0,iPr_def_11),implies(X0,a)))),
inference(superposition,[status(thm)],[c_86,c_57]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_57,c_55]) ).
tcf(c_248,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,implies(not(X1),not(X2)))) ),
inference(superposition,[status(thm)],[c_58,c_59]) ).
tcf(c_272,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_12))
| ~ is_a_theorem(implies(X0,implies(iPr_def_10,not(iPr_def_11)))) ),
inference(superposition,[status(thm)],[c_222,c_59]) ).
tcf(c_553,plain,
is_a_theorem(implies(implies(iPr_def_11,iPr_def_12),implies(implies(iPr_def_11,iPr_def_11),iPr_def_12))),
inference(superposition,[status(thm)],[c_86,c_230]) ).
tcf(c_604,plain,
( is_a_theorem(implies(implies(iPr_def_11,iPr_def_11),iPr_def_12))
| ~ is_a_theorem(implies(iPr_def_11,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_553,c_55]) ).
tcf(c_1474,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_56,c_248]) ).
tcf(c_1517,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_85,c_1474]) ).
tcf(c_1523,plain,
is_a_theorem(implies(not(iPr_def_10),iPr_def_12)),
inference(superposition,[status(thm)],[c_1474,c_272]) ).
tcf(c_1528,plain,
is_a_theorem(implies(iPr_def_11,iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_1523,c_85]) ).
tcf(c_1531,plain,
is_a_theorem(implies(implies(iPr_def_11,iPr_def_11),iPr_def_12)),
inference(backward_subsumption_resolution,[status(thm)],[c_604,c_1528]) ).
tcf(c_1568,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_12))
| ~ is_a_theorem(implies(X0,implies(iPr_def_11,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_1531,c_59]) ).
tcf(c_2215,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_12))
| ~ is_a_theorem(implies(iPr_def_11,implies(X0,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_233,c_1568]) ).
tcf(c_2224,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_12)),
inference(forward_subsumption_resolution,[status(thm)],[c_2215,c_56]) ).
tcf(c_2269,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_2224,c_55]) ).
tcf(c_2270,plain,
! [X0: $i] : ~ is_a_theorem(implies(iPr_def_11,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_2269,c_87]) ).
tcf(c_2273,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1517,c_2270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL077-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % 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 21:53:04 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 2.51/1.28 % SZS status Started for theBenchmark.p
% 2.51/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.51/1.28
% 2.51/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.51/1.28
% 2.51/1.28 % ------ iProver source info
% 2.51/1.28
% 2.51/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.51/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.51/1.28 % git: non_committed_changes: false
% 2.51/1.28
% 2.51/1.28 % ------ Parsing...% successful
% 2.51/1.28
% 2.51/1.28
% 2.51/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.51/1.28
% 2.51/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.51/1.28
% 2.51/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.51/1.28
% 2.51/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.51/1.28 % ------ Proving...
% 2.51/1.28 % ------ Problem Properties
% 2.51/1.28
% 2.51/1.28 %
% 2.51/1.28 % clauses 9
% 2.51/1.28 % conjectures 1
% 2.51/1.28 % EPR 1
% 2.51/1.28 % Horn 9
% 2.51/1.28 % unary 7
% 2.51/1.28 % binary 0
% 2.51/1.28 % lits 13
% 2.51/1.28 % lits eq 3
% 2.51/1.28 % fd_pure 0
% 2.51/1.28 % fd_pseudo 0
% 2.51/1.28 % fd_cond 0
% 2.51/1.28 % fd_pseudo_cond 0
% 2.51/1.28 % AC symbols 0
% 2.51/1.28
% 2.51/1.28 % ------ Schedule dynamic 5 is on
% 2.51/1.28
% 2.51/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.51/1.28
% 2.51/1.28
% 2.51/1.28 % ------
% 2.51/1.28 % Current options:
% 2.51/1.28 % ------
% 2.51/1.28
% 2.51/1.28
% 2.51/1.28 %
% 2.51/1.28
% 2.51/1.28 % ------ Proving...
% 2.51/1.28 %
% 2.51/1.28
% 2.51/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.51/1.28
% 2.51/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.51/1.28
% 2.51/1.28
%------------------------------------------------------------------------------