%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN007-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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 01:37:22 PM UTC 2026
% Result : Unsatisfiable 4.00s 1.30s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 43 unt; 2 def)
% Number of atoms : 94 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 49 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( divide(X0,X1) = zero
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
fof(f2,axiom,
! [X0,X1] :
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
fof(f3,axiom,
! [X0,X1] : less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
fof(f4,axiom,
! [X2,X0,X1] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
fof(f5,axiom,
! [X0] : less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
fof(f8,axiom,
less_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_LE_b) ).
fof(f9,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_divide_b_LE_c_divide_a) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i] : less_equal(zero,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
less_equal(a,b),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_134,definition,
iPr_def_10 = divide(c,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_135,definition,
iPr_def_11 = divide(c,a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_136,negated_conjecture,
~ less_equal(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_66,c_135,c_134]) ).
tcf(c_309,plain,
less_equal(iPr_def_11,c),
inference(superposition,[status(thm)],[c_135,c_60]) ).
tcf(c_312,plain,
divide(a,b) = zero,
inference(superposition,[status(thm)],[c_65,c_58]) ).
tcf(c_313,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_60,c_58]) ).
tcf(c_314,plain,
! [X0: $i] : divide(zero,X0) = zero,
inference(superposition,[status(thm)],[c_62,c_58]) ).
tcf(c_317,plain,
divide(iPr_def_11,c) = zero,
inference(superposition,[status(thm)],[c_309,c_58]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = X0 )
| ~ less_equal(X0,divide(X0,X1)) ),
inference(superposition,[status(thm)],[c_60,c_63]) ).
tcf(c_339,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_62,c_63]) ).
tcf(c_359,plain,
! [X0: $i] : less_equal(divide(iPr_def_10,divide(X0,b)),divide(divide(c,X0),b)),
inference(superposition,[status(thm)],[c_134,c_61]) ).
tcf(c_401,plain,
! [X0: $i,X1: $i] : less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
inference(superposition,[status(thm)],[c_314,c_61]) ).
tcf(c_443,plain,
! [X0: $i] : less_equal(divide(divide(iPr_def_11,X0),divide(c,X0)),divide(zero,X0)),
inference(superposition,[status(thm)],[c_317,c_61]) ).
tcf(c_445,plain,
! [X0: $i] : less_equal(divide(divide(iPr_def_11,X0),divide(c,X0)),zero),
inference(light_normalisation,[status(thm)],[c_443,c_314]) ).
tcf(c_465,plain,
! [X0: $i,X1: $i] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_313,c_61]) ).
tcf(c_511,plain,
less_equal(divide(iPr_def_10,divide(a,b)),divide(iPr_def_11,b)),
inference(superposition,[status(thm)],[c_135,c_359]) ).
tcf(c_515,plain,
less_equal(divide(iPr_def_10,zero),divide(iPr_def_11,b)),
inference(light_normalisation,[status(thm)],[c_511,c_312]) ).
tcf(c_599,plain,
less_equal(divide(divide(iPr_def_11,b),iPr_def_10),zero),
inference(superposition,[status(thm)],[c_134,c_445]) ).
tcf(c_610,plain,
divide(divide(iPr_def_11,b),iPr_def_10) = zero,
inference(superposition,[status(thm)],[c_599,c_339]) ).
tcf(c_653,plain,
! [X0: $i] : less_equal(divide(divide(X0,X0),zero),zero),
inference(superposition,[status(thm)],[c_313,c_465]) ).
tcf(c_717,plain,
! [X0: $i] : divide(divide(X0,X0),zero) = zero,
inference(superposition,[status(thm)],[c_653,c_339]) ).
tcf(c_728,plain,
less_equal(divide(iPr_def_11,b),iPr_def_10),
inference(superposition,[status(thm)],[c_610,c_59]) ).
tcf(c_808,plain,
! [X0: $i] : less_equal(divide(X0,X0),zero),
inference(superposition,[status(thm)],[c_717,c_59]) ).
tcf(c_823,plain,
! [X0: $i] : divide(X0,X0) = zero,
inference(superposition,[status(thm)],[c_808,c_339]) ).
tcf(c_1503,plain,
! [X0: $i] : less_equal(divide(divide(X0,divide(X0,zero)),zero),zero),
inference(superposition,[status(thm)],[c_823,c_401]) ).
tcf(c_1774,plain,
! [X0: $i] : divide(divide(X0,divide(X0,zero)),zero) = zero,
inference(superposition,[status(thm)],[c_1503,c_339]) ).
tcf(c_2957,plain,
! [X0: $i] :
( ( divide(divide(X0,divide(X0,zero)),zero) = divide(X0,divide(X0,zero)) )
| ~ less_equal(divide(X0,divide(X0,zero)),zero) ),
inference(superposition,[status(thm)],[c_1774,c_338]) ).
tcf(c_2965,plain,
! [X0: $i] : less_equal(divide(X0,divide(X0,zero)),zero),
inference(superposition,[status(thm)],[c_1774,c_59]) ).
tcf(c_2977,plain,
! [X0: $i] : divide(divide(X0,divide(X0,zero)),zero) = divide(X0,divide(X0,zero)),
inference(forward_subsumption_resolution,[status(thm)],[c_2957,c_2965]) ).
tcf(c_2978,plain,
! [X0: $i] : divide(X0,divide(X0,zero)) = zero,
inference(light_normalisation,[status(thm)],[c_2977,c_1774]) ).
tcf(c_3004,plain,
! [X0: $i] : less_equal(X0,divide(X0,zero)),
inference(superposition,[status(thm)],[c_2978,c_59]) ).
tcf(c_3090,plain,
! [X0: $i] : divide(X0,zero) = X0,
inference(superposition,[status(thm)],[c_3004,c_338]) ).
tcf(c_3110,plain,
less_equal(iPr_def_10,divide(iPr_def_11,b)),
inference(demodulation,[status(thm)],[c_515,c_3090]) ).
tcf(c_3126,plain,
( ( divide(iPr_def_11,b) = iPr_def_10 )
| ~ less_equal(divide(iPr_def_11,b),iPr_def_10) ),
inference(superposition,[status(thm)],[c_3110,c_63]) ).
tcf(c_3128,plain,
divide(iPr_def_11,b) = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_3126,c_728]) ).
tcf(c_3159,plain,
less_equal(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_3128,c_60]) ).
tcf(c_3167,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3159,c_136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n011.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Sep 23 16:13:58 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 4.00/1.30 % SZS status Started for theBenchmark.p
% 4.00/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.00/1.30
% 4.00/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.00/1.30
% 4.00/1.30 % ------ iProver source info
% 4.00/1.30
% 4.00/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.00/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.00/1.30 % git: non_committed_changes: false
% 4.00/1.30
% 4.00/1.30 % ------ Parsing...% successful
% 4.00/1.30
% 4.00/1.30
% 4.00/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.00/1.30
% 4.00/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.00/1.30
% 4.00/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.00/1.30
% 4.00/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.00/1.30 % ------ Proving...
% 4.00/1.30 % ------ Problem Properties
% 4.00/1.30
% 4.00/1.30 %
% 4.00/1.30 % clauses 11
% 4.00/1.30 % conjectures 1
% 4.00/1.30 % EPR 5
% 4.00/1.30 % Horn 11
% 4.00/1.30 % unary 8
% 4.00/1.30 % binary 2
% 4.00/1.30 % lits 15
% 4.00/1.30 % lits eq 5
% 4.00/1.30 % fd_pure 0
% 4.00/1.30 % fd_pseudo 0
% 4.00/1.30 % fd_cond 0
% 4.00/1.30 % fd_pseudo_cond 1
% 4.00/1.30 % AC symbols 0
% 4.00/1.30
% 4.00/1.30 % ------ Schedule dynamic 5 is on
% 4.00/1.30
% 4.00/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.00/1.30
% 4.00/1.30
% 4.00/1.30 % ------
% 4.00/1.30 % Current options:
% 4.00/1.30 % ------
% 4.00/1.30
% 4.00/1.30
% 4.00/1.30 %
% 4.00/1.30
% 4.00/1.30 % ------ Proving...
% 4.00/1.30 %
% 4.00/1.30
% 4.00/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.00/1.30
% 4.00/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.00/1.30
% 4.00/1.30
%------------------------------------------------------------------------------