%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL360-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 : n012.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 : Unsatisfiable 1.23s 1.17s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 18 unt; 5 def)
% Number of atoms : 47 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 9 :)
% 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(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_09) ).
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_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = not(x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = implies(iPr_def_10,y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,definition,
iPr_def_12 = implies(iPr_def_11,z),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,definition,
iPr_def_13 = implies(x,z),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_80,definition,
iPr_def_14 = implies(iPr_def_12,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_81,negated_conjecture,
~ is_a_theorem(iPr_def_14),
inference(demodulation,[status(thm)],[c_58,c_79,c_76,c_77,c_78,c_80]) ).
tcf(c_214,plain,
! [X0: $i] : is_a_theorem(implies(x,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_76,c_57]) ).
tcf(c_226,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_11),implies(iPr_def_12,implies(X0,z)))),
inference(superposition,[status(thm)],[c_78,c_55]) ).
tcf(c_256,plain,
is_a_theorem(implies(x,iPr_def_11)),
inference(superposition,[status(thm)],[c_77,c_214]) ).
tcf(c_462,plain,
is_a_theorem(implies(implies(x,iPr_def_11),implies(iPr_def_12,iPr_def_13))),
inference(superposition,[status(thm)],[c_79,c_226]) ).
tcf(c_465,plain,
is_a_theorem(implies(implies(x,iPr_def_11),iPr_def_14)),
inference(light_normalisation,[status(thm)],[c_462,c_80]) ).
tcf(c_477,plain,
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(implies(x,iPr_def_11)) ),
inference(superposition,[status(thm)],[c_465,c_54]) ).
tcf(c_478,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_477,c_81,c_256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL360-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Wed Sep 23 22:57:21 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.32 Running first-order theorem proving
% 0.02/0.32 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.02/0.33
% 0.02/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.33
% 0.02/0.33 % Detected problem language: tptp
% 0.02/0.34 % Proving...
% 1.23/1.17 % SZS status Started for theBenchmark.p
% 1.23/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.17
% 1.23/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.23/1.17
% 1.23/1.17 % ------ iProver source info
% 1.23/1.17
% 1.23/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.23/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.23/1.17 % git: non_committed_changes: false
% 1.23/1.17
% 1.23/1.17 % ------ Parsing...% successful
% 1.23/1.17
% 1.23/1.17
% 1.23/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.23/1.17
% 1.23/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.23/1.17
% 1.23/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.23/1.17
% 1.23/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.23/1.17 % ------ Proving...
% 1.23/1.17 % ------ Problem Properties
% 1.23/1.17
% 1.23/1.17 %
% 1.23/1.17 % clauses 10
% 1.23/1.17 % conjectures 1
% 1.23/1.17 % EPR 1
% 1.23/1.17 % Horn 10
% 1.23/1.17 % unary 9
% 1.23/1.17 % binary 0
% 1.23/1.17 % lits 12
% 1.23/1.17 % lits eq 5
% 1.23/1.17 % fd_pure 0
% 1.23/1.17 % fd_pseudo 0
% 1.23/1.17 % fd_cond 0
% 1.23/1.17 % fd_pseudo_cond 0
% 1.23/1.17 % AC symbols 0
% 1.23/1.17
% 1.23/1.17 % ------ Schedule dynamic 5 is on
% 1.23/1.17
% 1.23/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.23/1.17
% 1.23/1.17
% 1.23/1.17 % ------
% 1.23/1.17 % Current options:
% 1.23/1.17 % ------
% 1.23/1.17
% 1.23/1.17
% 1.23/1.17 %
% 1.23/1.17
% 1.23/1.17 % ------ Proving...
% 1.23/1.17 %
% 1.23/1.17
% 1.23/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.17
% 1.23/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.23/1.17
% 1.23/1.17
%------------------------------------------------------------------------------