%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:06:25 PM UTC 2026
% Result : Theorem 39.56s 31.28s
% Output : CNFRefutation 39.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 35 unt; 8 def)
% Number of atoms : 150 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 71 ( 40 ~; 29 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f5,conjecture,
is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_14) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_71,definition,
iPr_def_10 = implies(y,z),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_72,definition,
iPr_def_11 = implies(iPr_def_10,z),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_73,definition,
iPr_def_12 = implies(x,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_74,definition,
iPr_def_13 = implies(iPr_def_12,u),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_75,definition,
iPr_def_14 = not(z),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_76,definition,
iPr_def_15 = implies(iPr_def_14,y),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_77,definition,
iPr_def_16 = implies(iPr_def_15,u),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_78,definition,
iPr_def_17 = implies(iPr_def_13,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_79,negated_conjecture,
~ is_a_theorem(iPr_def_17),
inference(demodulation,[status(thm)],[c_53,c_75,c_76,c_77,c_71,c_72,c_73,c_74,c_78]) ).
tcf(c_200,plain,
is_a_theorem(implies(implies(iPr_def_14,z),z)),
inference(superposition,[status(thm)],[c_75,c_51]) ).
tcf(c_207,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_52,c_49]) ).
tcf(c_243,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_15,implies(implies(y,X0),implies(iPr_def_14,X0)))),
inference(superposition,[status(thm)],[c_76,c_50]) ).
tcf(c_249,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_12),implies(iPr_def_13,implies(X0,u)))),
inference(superposition,[status(thm)],[c_74,c_50]) ).
tcf(c_254,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_10,X0),implies(implies(X0,z),iPr_def_11))),
inference(superposition,[status(thm)],[c_72,c_50]) ).
tcf(c_255,plain,
! [X0: $i] : is_a_theorem(implies(implies(x,X0),implies(implies(X0,iPr_def_11),iPr_def_12))),
inference(superposition,[status(thm)],[c_73,c_50]) ).
tcf(c_258,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_15,X0),implies(implies(X0,u),iPr_def_16))),
inference(superposition,[status(thm)],[c_77,c_50]) ).
tcf(c_259,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_13,X0),implies(implies(X0,iPr_def_16),iPr_def_17))),
inference(superposition,[status(thm)],[c_78,c_50]) ).
tcf(c_260,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
tcf(c_515,plain,
is_a_theorem(implies(iPr_def_15,implies(iPr_def_10,implies(iPr_def_14,z)))),
inference(superposition,[status(thm)],[c_71,c_243]) ).
tcf(c_656,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_13,implies(X0,u)))
| ~ is_a_theorem(implies(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_249,c_49]) ).
tcf(c_791,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,iPr_def_11),iPr_def_12))
| ~ is_a_theorem(implies(x,X0)) ),
inference(superposition,[status(thm)],[c_255,c_49]) ).
tcf(c_830,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,u),iPr_def_16))
| ~ is_a_theorem(implies(iPr_def_15,X0)) ),
inference(superposition,[status(thm)],[c_258,c_49]) ).
tcf(c_836,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,iPr_def_16),iPr_def_17))
| ~ is_a_theorem(implies(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_259,c_49]) ).
tcf(c_899,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_260,c_49]) ).
tcf(c_1103,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_17)
| ~ is_a_theorem(implies(iPr_def_13,X0))
| ~ is_a_theorem(implies(X0,iPr_def_16)) ),
inference(superposition,[status(thm)],[c_836,c_49]) ).
tcf(c_1104,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_13,X0))
| ~ is_a_theorem(implies(X0,iPr_def_16)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1103,c_79]) ).
tcf(c_1115,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(X0,iPr_def_12))
| ~ is_a_theorem(implies(implies(X0,u),iPr_def_16)) ),
inference(superposition,[status(thm)],[c_656,c_1104]) ).
tcf(c_1156,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_15,X0))
| ~ is_a_theorem(implies(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_830,c_1115]) ).
tcf(c_1177,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(x,X0))
| ~ is_a_theorem(implies(iPr_def_15,implies(X0,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_791,c_1156]) ).
tcf(c_1474,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(superposition,[status(thm)],[c_52,c_899]) ).
tcf(c_1499,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X3,X1),X2))
| ~ is_a_theorem(implies(X0,X3))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_260,c_899]) ).
tcf(c_1517,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_15,X0))
| ~ is_a_theorem(implies(implies(iPr_def_10,implies(iPr_def_14,z)),X0)) ),
inference(superposition,[status(thm)],[c_515,c_899]) ).
tcf(c_15424,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_51,c_1499]) ).
tcf(c_15676,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),not(X1))) ),
inference(superposition,[status(thm)],[c_15424,c_1474]) ).
tcf(c_19792,plain,
is_a_theorem(implies(iPr_def_15,implies(implies(implies(iPr_def_14,z),z),iPr_def_11))),
inference(superposition,[status(thm)],[c_254,c_1517]) ).
tcf(c_27910,plain,
~ is_a_theorem(implies(x,implies(implies(iPr_def_14,z),z))),
inference(superposition,[status(thm)],[c_19792,c_1177]) ).
tcf(c_78981,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_207,c_15676]) ).
tcf(c_80346,plain,
~ is_a_theorem(implies(implies(iPr_def_14,z),z)),
inference(superposition,[status(thm)],[c_78981,c_27910]) ).
tcf(c_80880,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_80346,c_200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/25.40 % Computer : n008.cluster.edu
% 0.11/25.40 % Model : x86_64 x86_64
% 0.11/25.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/25.40 % Memory : 8046.5625MB
% 0.11/25.40 % OS : Linux 6.8.0-71-generic
% 0.11/25.40 % CPULimit : 300
% 0.11/25.40 % WCLimit : 300
% 0.11/25.40 % DateTime : Wed Sep 23 22:59:39 UTC 2026
% 0.11/25.41 % CPUTime :
% 0.11/25.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/25.44 Running first-order theorem proving
% 0.11/25.44 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/25.45
% 0.11/25.45 % ======== iProver multi-core TPTP/SMT =========
% 0.11/25.45
% 0.11/25.46 % Detected problem language: tptp
% 0.11/25.47 % Proving...
% 39.56/31.28 % SZS status Started for theBenchmark.p
% 39.56/31.28 % SZS status Theorem for theBenchmark.p
% 39.56/31.28
% 39.56/31.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 39.56/31.28
% 39.56/31.28 % ------ iProver source info
% 39.56/31.28
% 39.56/31.28 % git: date: 2026-07-19 20:42:38 +0200
% 39.56/31.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 39.56/31.28 % git: non_committed_changes: false
% 39.56/31.28
% 39.56/31.28 % ------ Parsing...
% 39.56/31.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 39.56/31.28
% 39.56/31.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 39.56/31.28
% 39.56/31.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 39.56/31.28
% 39.56/31.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 39.56/31.28 % ------ Proving...
% 39.56/31.28 % ------ Problem Properties
% 39.56/31.28
% 39.56/31.28 %
% 39.56/31.28 % clauses 13
% 39.56/31.28 % conjectures 1
% 39.56/31.28 % EPR 1
% 39.56/31.28 % Horn 13
% 39.56/31.28 % unary 12
% 39.56/31.28 % binary 0
% 39.56/31.28 % lits 15
% 39.56/31.28 % lits eq 8
% 39.56/31.28 % fd_pure 0
% 39.56/31.28 % fd_pseudo 0
% 39.56/31.28 % fd_cond 0
% 39.56/31.28 % fd_pseudo_cond 0
% 39.56/31.28 % AC symbols 0
% 39.56/31.28
% 39.56/31.28 % ------ Schedule dynamic 5 is on
% 39.56/31.28
% 39.56/31.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 39.56/31.28
% 39.56/31.28
% 39.56/31.28 % ------
% 39.56/31.28 % Current options:
% 39.56/31.28 % ------
% 39.56/31.28
% 39.56/31.28
% 39.56/31.28 %
% 39.56/31.28
% 39.56/31.28 % ------ Proving...
% 39.56/31.28 %
% 39.56/31.28
% 39.56/31.28 % SZS status Theorem for theBenchmark.p
% 39.56/31.28
% 39.56/31.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 39.56/31.29
% 39.56/31.29
%------------------------------------------------------------------------------