%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL358-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n005.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:24 PM UTC 2026
% Result : Unsatisfiable 1.33s 1.29s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 27 unt; 9 def)
% Number of atoms : 115 ( 9 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 32 ( 19 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 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 : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 21 :)
% 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,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(implies(y,z),u)),implies(implies(y,v),implies(x,implies(implies(v,z),u))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_07) ).
tcf(c_54,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_55,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(implies(y,z),u)),implies(implies(y,v),implies(x,implies(implies(v,z),u))))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = implies(y,z),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = implies(iPr_def_10,u),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,definition,
iPr_def_12 = implies(x,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,definition,
iPr_def_13 = implies(y,v),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_80,definition,
iPr_def_14 = implies(v,z),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_81,definition,
iPr_def_15 = implies(iPr_def_14,u),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_82,definition,
iPr_def_16 = implies(x,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_83,definition,
iPr_def_17 = implies(iPr_def_13,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_84,definition,
iPr_def_18 = implies(iPr_def_12,iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_85,negated_conjecture,
~ is_a_theorem(iPr_def_18),
inference(demodulation,[status(thm)],[c_58,c_80,c_81,c_82,c_79,c_83,c_76,c_77,c_78,c_84]) ).
tcf(c_312,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_13,implies(implies(v,X0),implies(y,X0)))),
inference(superposition,[status(thm)],[c_79,c_55]) ).
tcf(c_315,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_12,implies(implies(iPr_def_11,X0),implies(x,X0)))),
inference(superposition,[status(thm)],[c_78,c_55]) ).
tcf(c_323,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_10),implies(iPr_def_11,implies(X0,u)))),
inference(superposition,[status(thm)],[c_77,c_55]) ).
tcf(c_336,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_83,c_55]) ).
tcf(c_337,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_12,X0),implies(implies(X0,iPr_def_17),iPr_def_18))),
inference(superposition,[status(thm)],[c_84,c_55]) ).
tcf(c_338,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_55,c_54]) ).
tcf(c_437,plain,
is_a_theorem(implies(iPr_def_13,implies(implies(v,z),iPr_def_10))),
inference(superposition,[status(thm)],[c_76,c_312]) ).
tcf(c_440,plain,
is_a_theorem(implies(iPr_def_13,implies(iPr_def_14,iPr_def_10))),
inference(light_normalisation,[status(thm)],[c_437,c_80]) ).
tcf(c_554,plain,
is_a_theorem(implies(iPr_def_12,implies(implies(iPr_def_11,iPr_def_15),iPr_def_16))),
inference(superposition,[status(thm)],[c_82,c_315]) ).
tcf(c_775,plain,
is_a_theorem(implies(implies(iPr_def_14,iPr_def_10),implies(iPr_def_11,iPr_def_15))),
inference(superposition,[status(thm)],[c_81,c_323]) ).
tcf(c_1024,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_336,c_54]) ).
tcf(c_1030,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,iPr_def_17),iPr_def_18))
| ~ is_a_theorem(implies(iPr_def_12,X0)) ),
inference(superposition,[status(thm)],[c_337,c_54]) ).
tcf(c_1115,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_338,c_54]) ).
tcf(c_1396,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_18)
| ~ is_a_theorem(implies(iPr_def_12,X0))
| ~ is_a_theorem(implies(X0,iPr_def_17)) ),
inference(superposition,[status(thm)],[c_1030,c_54]) ).
tcf(c_1397,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_12,X0))
| ~ is_a_theorem(implies(X0,iPr_def_17)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1396,c_85]) ).
tcf(c_1408,plain,
~ is_a_theorem(implies(implies(implies(iPr_def_11,iPr_def_15),iPr_def_16),iPr_def_17)),
inference(superposition,[status(thm)],[c_554,c_1397]) ).
tcf(c_1429,plain,
~ is_a_theorem(implies(iPr_def_13,implies(iPr_def_11,iPr_def_15))),
inference(superposition,[status(thm)],[c_1024,c_1408]) ).
tcf(c_1755,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_13,X0))
| ~ is_a_theorem(implies(implies(iPr_def_14,iPr_def_10),X0)) ),
inference(superposition,[status(thm)],[c_440,c_1115]) ).
tcf(c_2672,plain,
is_a_theorem(implies(iPr_def_13,implies(iPr_def_11,iPr_def_15))),
inference(superposition,[status(thm)],[c_775,c_1755]) ).
tcf(c_2673,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2672,c_1429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL358-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n005.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 22:57:03 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.41 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...
% 1.33/1.29 % SZS status Started for theBenchmark.p
% 1.33/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.33/1.29
% 1.33/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.33/1.29
% 1.33/1.29 % ------ iProver source info
% 1.33/1.29
% 1.33/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.33/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.33/1.29 % git: non_committed_changes: false
% 1.33/1.29
% 1.33/1.29 % ------ Parsing...% successful
% 1.33/1.29
% 1.33/1.29
% 1.33/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.33/1.29
% 1.33/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.33/1.29
% 1.33/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.33/1.29
% 1.33/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.33/1.29 % ------ Proving...
% 1.33/1.29 % ------ Problem Properties
% 1.33/1.29
% 1.33/1.29 %
% 1.33/1.29 % clauses 14
% 1.33/1.29 % conjectures 1
% 1.33/1.29 % EPR 1
% 1.33/1.29 % Horn 14
% 1.33/1.29 % unary 13
% 1.33/1.29 % binary 0
% 1.33/1.29 % lits 16
% 1.33/1.29 % lits eq 9
% 1.33/1.29 % fd_pure 0
% 1.33/1.29 % fd_pseudo 0
% 1.33/1.29 % fd_cond 0
% 1.33/1.29 % fd_pseudo_cond 0
% 1.33/1.29 % AC symbols 0
% 1.33/1.29
% 1.33/1.29 % ------ Schedule dynamic 5 is on
% 1.33/1.29
% 1.33/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.33/1.29
% 1.33/1.29
% 1.33/1.29 % ------
% 1.33/1.29 % Current options:
% 1.33/1.29 % ------
% 1.33/1.29
% 1.33/1.29
% 1.33/1.29 %
% 1.33/1.29
% 1.33/1.29 % ------ Proving...
% 1.33/1.29 %
% 1.33/1.29
% 1.33/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.33/1.29
% 1.33/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.33/1.29
% 1.33/1.29
%------------------------------------------------------------------------------