%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN005-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:21 PM UTC 2026
% Result : Unsatisfiable 3.28s 1.31s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 23 unt; 0 def)
% Number of atoms : 41 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( divide(X0,X1) = zero
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
fof(f2,axiom,
! [X0,X1] :
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
fof(f4,axiom,
! [X2,X0,X1] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
fof(f5,axiom,
! [X0] : less_equal(zero,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
fof(f10,axiom,
! [X0] : divide(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
fof(f11,plain,
! [X0] : zero = divide(zero,X0),
inference(reorient_equations,[],[f10]) ).
fof(f14,axiom,
! [X0] : divide(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_zero_is_x) ).
fof(f15,axiom,
less_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
fof(f16,axiom,
less_equal(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_LE_c) ).
fof(f17,negated_conjecture,
~ less_equal(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_LE_c) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_66,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_67,plain,
! [X0: $i] : less_equal(zero,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_71,plain,
! [X0: $i] : divide(zero,X0) = zero,
inference(cnf_transformation,[],[f11]) ).
tcf(c_73,plain,
! [X0: $i] : divide(X0,zero) = X0,
inference(cnf_transformation,[],[f14]) ).
tcf(c_74,plain,
less_equal(a,b),
inference(cnf_transformation,[],[f15]) ).
tcf(c_75,plain,
less_equal(b,c),
inference(cnf_transformation,[],[f16]) ).
tcf(c_76,negated_conjecture,
~ less_equal(a,c),
inference(cnf_transformation,[],[f17]) ).
tcf(c_356,plain,
divide(a,b) = zero,
inference(superposition,[status(thm)],[c_74,c_63]) ).
tcf(c_357,plain,
divide(b,c) = zero,
inference(superposition,[status(thm)],[c_75,c_63]) ).
tcf(c_381,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_67,c_68]) ).
tcf(c_493,plain,
! [X0: $i] : less_equal(divide(divide(a,X0),divide(b,X0)),divide(zero,X0)),
inference(superposition,[status(thm)],[c_356,c_66]) ).
tcf(c_506,plain,
! [X0: $i] : less_equal(divide(divide(a,X0),divide(b,X0)),zero),
inference(light_normalisation,[status(thm)],[c_493,c_71]) ).
tcf(c_535,plain,
( less_equal(a,c)
| ( divide(a,c) != zero ) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_584,plain,
less_equal(divide(divide(a,c),zero),zero),
inference(superposition,[status(thm)],[c_357,c_506]) ).
tcf(c_595,plain,
less_equal(divide(a,c),zero),
inference(demodulation,[status(thm)],[c_584,c_73]) ).
tcf(c_598,plain,
divide(a,c) = zero,
inference(superposition,[status(thm)],[c_595,c_381]) ).
tcf(c_600,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_598,c_535,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n007.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 16:09:08 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 3.28/1.31 % SZS status Started for theBenchmark.p
% 3.28/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 3.28/1.31
% 3.28/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.28/1.31
% 3.28/1.31 % ------ iProver source info
% 3.28/1.31
% 3.28/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.28/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.28/1.31 % git: non_committed_changes: false
% 3.28/1.31
% 3.28/1.31 % ------ Parsing...% successful
% 3.28/1.31
% 3.28/1.31
% 3.28/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.28/1.31
% 3.28/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.28/1.31
% 3.28/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.28/1.31
% 3.28/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.31 % ------ Proving...
% 3.28/1.31 % ------ Problem Properties
% 3.28/1.31
% 3.28/1.31 %
% 3.28/1.31 % clauses 14
% 3.28/1.31 % conjectures 1
% 3.28/1.31 % EPR 6
% 3.28/1.31 % Horn 14
% 3.28/1.31 % unary 11
% 3.28/1.31 % binary 2
% 3.28/1.31 % lits 18
% 3.28/1.31 % lits eq 7
% 3.28/1.31 % fd_pure 0
% 3.28/1.31 % fd_pseudo 0
% 3.28/1.31 % fd_cond 0
% 3.28/1.31 % fd_pseudo_cond 1
% 3.28/1.31 % AC symbols 0
% 3.28/1.31
% 3.28/1.31 % ------ Schedule dynamic 5 is on
% 3.28/1.31
% 3.28/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.28/1.31
% 3.28/1.31
% 3.28/1.31 % ------
% 3.28/1.31 % Current options:
% 3.28/1.31 % ------
% 3.28/1.31
% 3.28/1.31
% 3.28/1.31 %
% 3.28/1.31
% 3.28/1.31 % ------ Proving...
% 3.28/1.31 %
% 3.28/1.31
% 3.28/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 3.28/1.31
% 3.28/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.32
% 3.28/1.32
%------------------------------------------------------------------------------