%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL399-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 : n010.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:32 PM UTC 2026
% Result : Unsatisfiable 2.10s 1.20s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 29 unt; 5 def)
% Number of atoms : 130 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 56 ( 31 ~; 25 |; 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 : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?; 50 :)
% 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(implies(not(x),not(implies(y,y))),x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_65) ).
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(implies(not(x),not(implies(y,y))),x)),
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(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,definition,
iPr_def_13 = implies(iPr_def_10,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_80,definition,
iPr_def_14 = implies(iPr_def_13,x),
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_77,c_78,c_76,c_79,c_80]) ).
tcf(c_190,plain,
is_a_theorem(implies(implies(iPr_def_10,x),x)),
inference(superposition,[status(thm)],[c_76,c_56]) ).
tcf(c_191,plain,
is_a_theorem(implies(implies(iPr_def_12,iPr_def_11),iPr_def_11)),
inference(superposition,[status(thm)],[c_78,c_56]) ).
tcf(c_193,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(iPr_def_12,X0))),
inference(superposition,[status(thm)],[c_78,c_57]) ).
tcf(c_220,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_13,implies(implies(iPr_def_12,X0),implies(iPr_def_10,X0)))),
inference(superposition,[status(thm)],[c_79,c_55]) ).
tcf(c_225,plain,
! [X0: $i] : is_a_theorem(implies(implies(y,X0),implies(implies(X0,y),iPr_def_11))),
inference(superposition,[status(thm)],[c_77,c_55]) ).
tcf(c_227,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_13,X0),implies(implies(X0,x),iPr_def_14))),
inference(superposition,[status(thm)],[c_80,c_55]) ).
tcf(c_228,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_265,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_12,X0))
| ~ is_a_theorem(iPr_def_11) ),
inference(superposition,[status(thm)],[c_193,c_54]) ).
tcf(c_447,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,y),iPr_def_11))
| ~ is_a_theorem(implies(y,X0)) ),
inference(superposition,[status(thm)],[c_225,c_54]) ).
tcf(c_459,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,x),iPr_def_14))
| ~ is_a_theorem(implies(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_227,c_54]) ).
tcf(c_542,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_11)
| ~ is_a_theorem(implies(y,X0))
| ~ is_a_theorem(implies(X0,y)) ),
inference(superposition,[status(thm)],[c_447,c_54]) ).
tcf(c_562,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(implies(iPr_def_13,X0))
| ~ is_a_theorem(implies(X0,x)) ),
inference(superposition,[status(thm)],[c_459,c_54]) ).
tcf(c_563,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_13,X0))
| ~ is_a_theorem(implies(X0,x)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_562,c_81]) ).
tcf(c_607,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_228,c_54]) ).
tcf(c_792,plain,
( is_a_theorem(iPr_def_11)
| ~ is_a_theorem(implies(y,implies(not(y),y))) ),
inference(superposition,[status(thm)],[c_56,c_542]) ).
tcf(c_802,plain,
is_a_theorem(iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_792,c_57]) ).
tcf(c_811,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_12,X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_265,c_802]) ).
tcf(c_901,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_56,c_607]) ).
tcf(c_902,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_607]) ).
tcf(c_904,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_12,iPr_def_11),X0))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_191,c_607]) ).
tcf(c_906,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(iPr_def_11,X1))
| ~ is_a_theorem(implies(implies(iPr_def_12,X0),X1)) ),
inference(superposition,[status(thm)],[c_193,c_607]) ).
tcf(c_909,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(iPr_def_13,X1))
| ~ is_a_theorem(implies(implies(implies(iPr_def_12,X0),implies(iPr_def_10,X0)),X1)) ),
inference(superposition,[status(thm)],[c_220,c_607]) ).
tcf(c_1676,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_12,iPr_def_11))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_904,c_54]) ).
tcf(c_1678,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1676,c_811]) ).
tcf(c_2186,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(iPr_def_11,implies(implies(X0,X1),implies(iPr_def_12,X1)))),
inference(superposition,[status(thm)],[c_55,c_906]) ).
tcf(c_2258,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,X1),implies(iPr_def_12,X1))),
inference(superposition,[status(thm)],[c_2186,c_1678]) ).
tcf(c_2426,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(iPr_def_12,X1))),
inference(superposition,[status(thm)],[c_2258,c_902]) ).
tcf(c_2847,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(iPr_def_13,implies(X0,implies(iPr_def_10,X1))))
| ~ is_a_theorem(implies(X0,implies(iPr_def_12,X1))) ),
inference(superposition,[status(thm)],[c_228,c_909]) ).
tcf(c_2856,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(iPr_def_13,implies(X0,implies(iPr_def_10,X1)))),
inference(forward_subsumption_resolution,[status(thm)],[c_2847,c_2426]) ).
tcf(c_3073,plain,
! [X0: $i,X1: $i] : ~ is_a_theorem(implies(implies(X0,implies(iPr_def_10,X1)),x)),
inference(superposition,[status(thm)],[c_2856,c_563]) ).
tcf(c_3104,plain,
! [X0: $i] : ~ is_a_theorem(implies(implies(iPr_def_10,X0),x)),
inference(superposition,[status(thm)],[c_901,c_3073]) ).
tcf(c_3106,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_190,c_3104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL399-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.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 23:12:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 2.10/1.20 % SZS status Started for theBenchmark.p
% 2.10/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/1.20
% 2.10/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.10/1.20
% 2.10/1.20 % ------ iProver source info
% 2.10/1.20
% 2.10/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 2.10/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.10/1.20 % git: non_committed_changes: false
% 2.10/1.20
% 2.10/1.20 % ------ Parsing...% successful
% 2.10/1.20
% 2.10/1.20
% 2.10/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.10/1.20
% 2.10/1.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.10/1.20
% 2.10/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.10/1.20
% 2.10/1.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.10/1.20 % ------ Proving...
% 2.10/1.20 % ------ Problem Properties
% 2.10/1.20
% 2.10/1.20 %
% 2.10/1.20 % clauses 10
% 2.10/1.20 % conjectures 1
% 2.10/1.20 % EPR 1
% 2.10/1.20 % Horn 10
% 2.10/1.20 % unary 9
% 2.10/1.20 % binary 0
% 2.10/1.20 % lits 12
% 2.10/1.20 % lits eq 5
% 2.10/1.20 % fd_pure 0
% 2.10/1.20 % fd_pseudo 0
% 2.10/1.20 % fd_cond 0
% 2.10/1.20 % fd_pseudo_cond 0
% 2.10/1.20 % AC symbols 0
% 2.10/1.20
% 2.10/1.20 % ------ Schedule dynamic 5 is on
% 2.10/1.20
% 2.10/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.10/1.20
% 2.10/1.20
% 2.10/1.20 % ------
% 2.10/1.20 % Current options:
% 2.10/1.20 % ------
% 2.10/1.20
% 2.10/1.20
% 2.10/1.20 %
% 2.10/1.20
% 2.10/1.20 % ------ Proving...
% 2.10/1.20 %
% 2.10/1.20
% 2.10/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.10/1.20
% 2.10/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.10/1.21
%------------------------------------------------------------------------------