%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL355-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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.57s 1.39s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 19 unt; 7 def)
% Number of atoms : 58 ( 7 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 : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_04) ).
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(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = implies(x,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = implies(z,y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,definition,
iPr_def_12 = implies(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,definition,
iPr_def_13 = implies(iPr_def_12,u),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_80,definition,
iPr_def_14 = implies(z,x),
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(iPr_def_13,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_83,negated_conjecture,
~ is_a_theorem(iPr_def_16),
inference(demodulation,[status(thm)],[c_58,c_80,c_81,c_77,c_76,c_78,c_79,c_82]) ).
tcf(c_228,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_14,implies(implies(x,X0),implies(z,X0)))),
inference(superposition,[status(thm)],[c_80,c_55]) ).
tcf(c_237,plain,
! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_12),implies(iPr_def_13,implies(X0,u)))),
inference(superposition,[status(thm)],[c_79,c_55]) ).
tcf(c_382,plain,
is_a_theorem(implies(iPr_def_14,implies(implies(x,y),iPr_def_11))),
inference(superposition,[status(thm)],[c_77,c_228]) ).
tcf(c_385,plain,
is_a_theorem(implies(iPr_def_14,iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_382,c_76,c_78]) ).
tcf(c_637,plain,
is_a_theorem(implies(implies(iPr_def_14,iPr_def_12),implies(iPr_def_13,iPr_def_15))),
inference(superposition,[status(thm)],[c_81,c_237]) ).
tcf(c_639,plain,
is_a_theorem(implies(implies(iPr_def_14,iPr_def_12),iPr_def_16)),
inference(light_normalisation,[status(thm)],[c_637,c_82]) ).
tcf(c_643,plain,
( is_a_theorem(iPr_def_16)
| ~ is_a_theorem(implies(iPr_def_14,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_639,c_54]) ).
tcf(c_644,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_643,c_83,c_385]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL355-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.59 % Computer : n016.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Wed Sep 23 23:01:59 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.63 Running first-order theorem proving
% 0.15/0.63 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.15/0.64
% 0.15/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.64
% 0.15/0.64 % Detected problem language: tptp
% 0.15/0.65 % Proving...
% 1.57/1.39 % SZS status Started for theBenchmark.p
% 1.57/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.57/1.39
% 1.57/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.57/1.39
% 1.57/1.39 % ------ iProver source info
% 1.57/1.39
% 1.57/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 1.57/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.57/1.39 % git: non_committed_changes: false
% 1.57/1.39
% 1.57/1.39 % ------ Parsing...% successful
% 1.57/1.39
% 1.57/1.39
% 1.57/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.57/1.39
% 1.57/1.39 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.57/1.39
% 1.57/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.57/1.39
% 1.57/1.39 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.57/1.39 % ------ Proving...
% 1.57/1.39 % ------ Problem Properties
% 1.57/1.39
% 1.57/1.39 %
% 1.57/1.39 % clauses 12
% 1.57/1.39 % conjectures 1
% 1.57/1.39 % EPR 1
% 1.57/1.39 % Horn 12
% 1.57/1.39 % unary 11
% 1.57/1.39 % binary 0
% 1.57/1.39 % lits 14
% 1.57/1.39 % lits eq 7
% 1.57/1.39 % fd_pure 0
% 1.57/1.39 % fd_pseudo 0
% 1.57/1.39 % fd_cond 0
% 1.57/1.39 % fd_pseudo_cond 0
% 1.57/1.39 % AC symbols 0
% 1.57/1.39
% 1.57/1.39 % ------ Schedule dynamic 5 is on
% 1.57/1.39
% 1.57/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.57/1.39
% 1.57/1.39
% 1.57/1.39 % ------
% 1.57/1.39 % Current options:
% 1.57/1.39 % ------
% 1.57/1.39
% 1.57/1.39
% 1.57/1.39 %
% 1.57/1.39
% 1.57/1.39 % ------ Proving...
% 1.57/1.39 %
% 1.57/1.39
% 1.57/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.57/1.39
% 1.57/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.57/1.39
% 1.57/1.39
%------------------------------------------------------------------------------