%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL363-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 : n011.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.71s 1.19s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 25 unt; 4 def)
% Number of atoms : 85 ( 4 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 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/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(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,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_12) ).
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_56,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f3]) ).
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(x,implies(implies(not(y),y),y))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = not(y),
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,y),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,definition,
iPr_def_13 = implies(x,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_80,negated_conjecture,
~ is_a_theorem(iPr_def_13),
inference(demodulation,[status(thm)],[c_58,c_76,c_77,c_78,c_79]) ).
tcf(c_185,plain,
is_a_theorem(implies(implies(iPr_def_10,y),y)),
inference(superposition,[status(thm)],[c_76,c_56]) ).
tcf(c_186,plain,
is_a_theorem(iPr_def_12),
inference(light_normalisation,[status(thm)],[c_185,c_77,c_78]) ).
tcf(c_212,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_12,implies(implies(y,X0),implies(iPr_def_11,X0)))),
inference(superposition,[status(thm)],[c_78,c_55]) ).
tcf(c_219,plain,
! [X0: $i] : is_a_theorem(implies(implies(x,X0),implies(implies(X0,iPr_def_12),iPr_def_13))),
inference(superposition,[status(thm)],[c_79,c_55]) ).
tcf(c_220,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_307,plain,
is_a_theorem(implies(iPr_def_12,implies(implies(y,y),iPr_def_12))),
inference(superposition,[status(thm)],[c_78,c_212]) ).
tcf(c_319,plain,
( is_a_theorem(implies(implies(y,y),iPr_def_12))
| ~ is_a_theorem(iPr_def_12) ),
inference(superposition,[status(thm)],[c_307,c_54]) ).
tcf(c_320,plain,
is_a_theorem(implies(implies(y,y),iPr_def_12)),
inference(forward_subsumption_resolution,[status(thm)],[c_319,c_186]) ).
tcf(c_486,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,iPr_def_12),iPr_def_13))
| ~ is_a_theorem(implies(x,X0)) ),
inference(superposition,[status(thm)],[c_219,c_54]) ).
tcf(c_585,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_220,c_54]) ).
tcf(c_650,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_13)
| ~ is_a_theorem(implies(x,X0))
| ~ is_a_theorem(implies(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_486,c_54]) ).
tcf(c_651,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(x,X0))
| ~ is_a_theorem(implies(X0,iPr_def_12)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_650,c_80]) ).
tcf(c_749,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_57,c_585]) ).
tcf(c_771,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(y,y),X0))
| ~ is_a_theorem(implies(iPr_def_12,X0)) ),
inference(superposition,[status(thm)],[c_320,c_585]) ).
tcf(c_1129,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_749]) ).
tcf(c_1130,plain,
! [X0: $i] : is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_56,c_749]) ).
tcf(c_2311,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(y,y))
| ~ is_a_theorem(implies(iPr_def_12,X0)) ),
inference(superposition,[status(thm)],[c_771,c_54]) ).
tcf(c_2315,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_12,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2311,c_1130]) ).
tcf(c_2414,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,X1),implies(not(iPr_def_12),X1))),
inference(superposition,[status(thm)],[c_1129,c_2315]) ).
tcf(c_2520,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(iPr_def_12),X1))),
inference(superposition,[status(thm)],[c_2414,c_749]) ).
tcf(c_2529,plain,
! [X0: $i] : ~ is_a_theorem(implies(implies(not(iPr_def_12),X0),iPr_def_12)),
inference(superposition,[status(thm)],[c_2520,c_651]) ).
tcf(c_2545,plain,
$false,
inference(superposition,[status(thm)],[c_56,c_2529]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL363-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.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 22:57:57 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.71/1.19 % SZS status Started for theBenchmark.p
% 1.71/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.19
% 1.71/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.71/1.19
% 1.71/1.19 % ------ iProver source info
% 1.71/1.19
% 1.71/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.71/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.71/1.19 % git: non_committed_changes: false
% 1.71/1.19
% 1.71/1.19 % ------ Parsing...% successful
% 1.71/1.19
% 1.71/1.19
% 1.71/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.71/1.19
% 1.71/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.71/1.19
% 1.71/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.71/1.19
% 1.71/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.71/1.19 % ------ Proving...
% 1.71/1.19 % ------ Problem Properties
% 1.71/1.19
% 1.71/1.19 %
% 1.71/1.19 % clauses 9
% 1.71/1.19 % conjectures 1
% 1.71/1.19 % EPR 1
% 1.71/1.19 % Horn 9
% 1.71/1.19 % unary 8
% 1.71/1.19 % binary 0
% 1.71/1.19 % lits 11
% 1.71/1.19 % lits eq 4
% 1.71/1.19 % fd_pure 0
% 1.71/1.19 % fd_pseudo 0
% 1.71/1.19 % fd_cond 0
% 1.71/1.19 % fd_pseudo_cond 0
% 1.71/1.19 % AC symbols 0
% 1.71/1.19
% 1.71/1.19 % ------ Schedule dynamic 5 is on
% 1.71/1.19
% 1.71/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.71/1.19
% 1.71/1.19
% 1.71/1.19 % ------
% 1.71/1.19 % Current options:
% 1.71/1.19 % ------
% 1.71/1.19
% 1.71/1.19
% 1.71/1.19 %
% 1.71/1.19
% 1.71/1.19 % ------ Proving...
% 1.71/1.19 %
% 1.71/1.19
% 1.71/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.19
% 1.71/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.71/1.20
% 1.71/1.20
%------------------------------------------------------------------------------