%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL397-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:31 PM UTC 2026
% Result : Unsatisfiable 2.93s 1.06s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 17 unt; 2 def)
% Number of atoms : 68 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 44 ( 25 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?; 35 :)
% 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(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
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(x,implies(y,y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_63) ).
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(y,y))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = implies(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = implies(x,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,negated_conjecture,
~ is_a_theorem(iPr_def_11),
inference(demodulation,[status(thm)],[c_58,c_76,c_77]) ).
tcf(c_201,plain,
! [X0: $i] : is_a_theorem(implies(implies(y,X0),implies(implies(X0,y),iPr_def_10))),
inference(superposition,[status(thm)],[c_76,c_55]) ).
tcf(c_202,plain,
! [X0: $i] : is_a_theorem(implies(implies(x,X0),implies(implies(X0,iPr_def_10),iPr_def_11))),
inference(superposition,[status(thm)],[c_77,c_55]) ).
tcf(c_203,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_262,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,y),iPr_def_10))
| ~ is_a_theorem(implies(y,X0)) ),
inference(superposition,[status(thm)],[c_201,c_54]) ).
tcf(c_268,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,iPr_def_10),iPr_def_11))
| ~ is_a_theorem(implies(x,X0)) ),
inference(superposition,[status(thm)],[c_202,c_54]) ).
tcf(c_297,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_10)
| ~ is_a_theorem(implies(y,X0))
| ~ is_a_theorem(implies(X0,y)) ),
inference(superposition,[status(thm)],[c_262,c_54]) ).
tcf(c_318,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_203,c_54]) ).
tcf(c_327,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_11)
| ~ is_a_theorem(implies(x,X0))
| ~ is_a_theorem(implies(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_268,c_54]) ).
tcf(c_328,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(x,X0))
| ~ is_a_theorem(implies(X0,iPr_def_10)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_327,c_78]) ).
tcf(c_357,plain,
( is_a_theorem(iPr_def_10)
| ~ is_a_theorem(implies(y,implies(not(y),y))) ),
inference(superposition,[status(thm)],[c_56,c_297]) ).
tcf(c_360,plain,
is_a_theorem(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_357,c_57]) ).
tcf(c_376,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_318]) ).
tcf(c_621,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_376]) ).
tcf(c_782,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_621,c_54]) ).
tcf(c_829,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_782,c_376]) ).
tcf(c_914,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(not(X0),X1),iPr_def_10)) ),
inference(superposition,[status(thm)],[c_829,c_328]) ).
tcf(c_950,plain,
~ is_a_theorem(iPr_def_10),
inference(superposition,[status(thm)],[c_56,c_914]) ).
tcf(c_953,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_950,c_360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL397-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 23:11:06 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.29 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.31 Running first-order theorem proving
% 0.02/0.31 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.32
% 0.02/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.32
% 0.02/0.32 % Detected problem language: tptp
% 0.02/0.33 % Proving...
% 2.93/1.06 % SZS status Started for theBenchmark.p
% 2.93/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 2.93/1.06
% 2.93/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.93/1.06
% 2.93/1.06 % ------ iProver source info
% 2.93/1.06
% 2.93/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 2.93/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.93/1.06 % git: non_committed_changes: false
% 2.93/1.06
% 2.93/1.06 % ------ Parsing...% successful
% 2.93/1.06
% 2.93/1.06
% 2.93/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.93/1.06
% 2.93/1.06 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.93/1.06
% 2.93/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.93/1.06
% 2.93/1.06 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.93/1.06 % ------ Proving...
% 2.93/1.06 % ------ Problem Properties
% 2.93/1.06
% 2.93/1.06 %
% 2.93/1.06 % clauses 7
% 2.93/1.06 % conjectures 1
% 2.93/1.06 % EPR 1
% 2.93/1.06 % Horn 7
% 2.93/1.06 % unary 6
% 2.93/1.06 % binary 0
% 2.93/1.06 % lits 9
% 2.93/1.06 % lits eq 2
% 2.93/1.06 % fd_pure 0
% 2.93/1.06 % fd_pseudo 0
% 2.93/1.06 % fd_cond 0
% 2.93/1.06 % fd_pseudo_cond 0
% 2.93/1.06 % AC symbols 0
% 2.93/1.06
% 2.93/1.06 % ------ Schedule dynamic 5 is on
% 2.93/1.06
% 2.93/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.93/1.06
% 2.93/1.06
% 2.93/1.06 % ------
% 2.93/1.06 % Current options:
% 2.93/1.06 % ------
% 2.93/1.06
% 2.93/1.06
% 2.93/1.06 %
% 2.93/1.06
% 2.93/1.06 % ------ Proving...
% 2.93/1.06 %
% 2.93/1.06
% 2.93/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 2.93/1.06
% 2.93/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.93/1.06
% 2.93/1.06
%------------------------------------------------------------------------------