%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL042-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 : n001.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 1.59s 1.36s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 31 unt; 6 def)
% Number of atoms : 106 ( 6 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 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 : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 34 :)
% 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(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_35) ).
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(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_86,definition,
iPr_def_10 = implies(b,c),
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(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_89,definition,
iPr_def_13 = implies(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_90,definition,
iPr_def_14 = implies(iPr_def_12,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_91,definition,
iPr_def_15 = implies(iPr_def_11,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_92,negated_conjecture,
~ is_a_theorem(iPr_def_15),
inference(demodulation,[status(thm)],[c_62,c_89,c_88,c_90,c_86,c_87,c_91]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_58,c_56]) ).
tcf(c_315,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(not(X0),X1),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_61,c_56]) ).
tcf(c_337,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_12,implies(X0,iPr_def_13)),implies(X0,iPr_def_14))),
inference(superposition,[status(thm)],[c_90,c_59]) ).
tcf(c_338,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,implies(X0,iPr_def_14)),implies(X0,iPr_def_15))),
inference(superposition,[status(thm)],[c_91,c_59]) ).
tcf(c_339,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_378,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_10,implies(implies(X0,b),implies(X0,c)))),
inference(superposition,[status(thm)],[c_86,c_60]) ).
tcf(c_387,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_10,X0),implies(iPr_def_11,implies(a,X0)))),
inference(superposition,[status(thm)],[c_87,c_60]) ).
tcf(c_539,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_315,c_56]) ).
tcf(c_659,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_14))
| ~ is_a_theorem(implies(iPr_def_12,implies(X0,iPr_def_13))) ),
inference(superposition,[status(thm)],[c_337,c_56]) ).
tcf(c_688,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_15))
| ~ is_a_theorem(implies(iPr_def_11,implies(X0,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_338,c_56]) ).
tcf(c_694,plain,
is_a_theorem(implies(iPr_def_10,implies(implies(a,b),iPr_def_13))),
inference(superposition,[status(thm)],[c_89,c_378]) ).
tcf(c_696,plain,
is_a_theorem(implies(iPr_def_10,iPr_def_14)),
inference(light_normalisation,[status(thm)],[c_694,c_88,c_90]) ).
tcf(c_719,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_57,c_339]) ).
tcf(c_879,plain,
is_a_theorem(implies(not(a),iPr_def_13)),
inference(superposition,[status(thm)],[c_89,c_719]) ).
tcf(c_1473,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_11,implies(a,X0)))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_387,c_56]) ).
tcf(c_2525,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_14))
| ~ is_a_theorem(implies(X0,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_213,c_659]) ).
tcf(c_2552,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_15))
| ~ is_a_theorem(implies(X0,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_213,c_688]) ).
tcf(c_2813,plain,
is_a_theorem(implies(not(a),iPr_def_14)),
inference(superposition,[status(thm)],[c_879,c_2525]) ).
tcf(c_3021,plain,
( is_a_theorem(implies(a,iPr_def_15))
| ~ is_a_theorem(implies(iPr_def_10,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_1473,c_688]) ).
tcf(c_3022,plain,
is_a_theorem(implies(a,iPr_def_15)),
inference(forward_subsumption_resolution,[status(thm)],[c_3021,c_696]) ).
tcf(c_3078,plain,
is_a_theorem(implies(not(a),iPr_def_15)),
inference(superposition,[status(thm)],[c_2813,c_2552]) ).
tcf(c_3210,plain,
( is_a_theorem(iPr_def_15)
| ~ is_a_theorem(implies(a,iPr_def_15)) ),
inference(superposition,[status(thm)],[c_3078,c_539]) ).
tcf(c_3211,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3210,c_92,c_3022]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL042-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.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:48:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.14/0.44
% 0.14/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.46 % Proving...
% 1.59/1.36 % SZS status Started for theBenchmark.p
% 1.59/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/1.36
% 1.59/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/1.36
% 1.59/1.36 % ------ iProver source info
% 1.59/1.36
% 1.59/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/1.36 % git: non_committed_changes: false
% 1.59/1.36
% 1.59/1.36 % ------ Parsing...% successful
% 1.59/1.36
% 1.59/1.36
% 1.59/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/1.36
% 1.59/1.36 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.59/1.36
% 1.59/1.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.59/1.36
% 1.59/1.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.59/1.36 % ------ Proving...
% 1.59/1.36 % ------ Problem Properties
% 1.59/1.36
% 1.59/1.36 %
% 1.59/1.36 % clauses 13
% 1.59/1.36 % conjectures 1
% 1.59/1.36 % EPR 1
% 1.59/1.36 % Horn 13
% 1.59/1.36 % unary 12
% 1.59/1.36 % binary 0
% 1.59/1.36 % lits 15
% 1.59/1.36 % lits eq 6
% 1.59/1.36 % fd_pure 0
% 1.59/1.36 % fd_pseudo 0
% 1.59/1.36 % fd_cond 0
% 1.59/1.36 % fd_pseudo_cond 0
% 1.59/1.36 % AC symbols 0
% 1.59/1.36
% 1.59/1.36 % ------ Schedule dynamic 5 is on
% 1.59/1.36
% 1.59/1.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.59/1.36
% 1.59/1.36
% 1.59/1.36 % ------
% 1.59/1.36 % Current options:
% 1.59/1.36 % ------
% 1.59/1.36
% 1.59/1.36
% 1.59/1.36 %
% 1.59/1.36
% 1.59/1.36 % ------ Proving...
% 1.59/1.36 %
% 1.59/1.36
% 1.59/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/1.36
% 1.59/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/1.36
% 1.59/1.36
%------------------------------------------------------------------------------