%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n008.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:26 PM UTC 2026
% Result : Unsatisfiable 10.50s 2.15s
% Output : CNFRefutation 10.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 28 unt; 0 def)
% Number of atoms : 66 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 86 !; 0 ?; 64 :)
% 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(f3,axiom,
! [X0,X1] : less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox/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/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(f12,axiom,
! [X0] : divide(X0,X0) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
fof(f13,plain,
! [X0] : zero = divide(X0,X0),
inference(reorient_equations,[],[f12]) ).
fof(f17,axiom,
! [X2,X0,X1] :
( less_equal(divide(X0,X2),X1)
| ~ less_equal(divide(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).
fof(f19,axiom,
! [X2,X0,X1] :
( less_equal(divide(X0,X2),divide(X1,X2))
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide3) ).
fof(f20,axiom,
! [X0] : divide(identity,divide(identity,divide(identity,X0))) = divide(identity,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_inversion_equals_three) ).
fof(f21,plain,
! [X0] : divide(identity,X0) = divide(identity,divide(identity,divide(identity,X0))),
inference(reorient_equations,[],[f20]) ).
fof(f24,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_67,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
inference(cnf_transformation,[],[f24]) ).
tcf(c_68,plain,
! [X0: $i] : divide(X0,X0) = zero,
inference(cnf_transformation,[],[f13]) ).
tcf(c_70,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,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(divide(X0,X2),divide(X1,X2))
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(divide(X0,X2),X1)
| ~ less_equal(divide(X0,X1),X2) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_76,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_77,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_79,plain,
! [X0: $i] : divide(identity,divide(identity,divide(identity,X0))) = divide(identity,X0),
inference(cnf_transformation,[],[f21]) ).
tcf(c_83,plain,
! [X0: $i] : less_equal(zero,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_498,plain,
! [X0: $i] : less_equal(X0,X0),
inference(superposition,[status(thm)],[c_68,c_71]) ).
tcf(c_510,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_77,c_72]) ).
tcf(c_740,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(divide(X0,divide(X1,X2)),X2)
| ~ less_equal(X0,X1) ),
inference(superposition,[status(thm)],[c_73,c_75]) ).
tcf(c_743,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,divide(X0,X1)),X1),
inference(superposition,[status(thm)],[c_498,c_75]) ).
tcf(c_867,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_83,c_70]) ).
tcf(c_1086,plain,
! [X0: $i,X1: $i] : divide(divide(X0,divide(X0,X1)),X1) = zero,
inference(superposition,[status(thm)],[c_743,c_72]) ).
tcf(c_1273,plain,
! [X0: $i] : divide(X0,divide(X0,zero)) = zero,
inference(superposition,[status(thm)],[c_743,c_867]) ).
tcf(c_1361,plain,
! [X0: $i] : less_equal(X0,divide(X0,zero)),
inference(superposition,[status(thm)],[c_1273,c_71]) ).
tcf(c_1424,plain,
! [X0: $i] :
( ( divide(X0,zero) = X0 )
| ~ less_equal(divide(X0,zero),X0) ),
inference(superposition,[status(thm)],[c_1361,c_70]) ).
tcf(c_1432,plain,
! [X0: $i] : divide(X0,zero) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_1424,c_77]) ).
tcf(c_2800,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(divide(X0,zero),X1)
| ~ less_equal(X0,divide(X1,X2)) ),
inference(superposition,[status(thm)],[c_510,c_740]) ).
tcf(c_2805,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(divide(X0,zero),X2)
| ~ less_equal(X0,divide(X1,divide(X1,X2))) ),
inference(superposition,[status(thm)],[c_1086,c_740]) ).
tcf(c_2818,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X0,X1)
| ~ less_equal(X0,divide(X1,X2)) ),
inference(light_normalisation,[status(thm)],[c_2800,c_1432]) ).
tcf(c_2823,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X0,X2)
| ~ less_equal(X0,divide(X1,divide(X1,X2))) ),
inference(light_normalisation,[status(thm)],[c_2805,c_1432]) ).
tcf(c_2885,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(X0,X2)),
inference(superposition,[status(thm)],[c_76,c_2818]) ).
tcf(c_5209,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(divide(X0,X2),X1)),X2),
inference(superposition,[status(thm)],[c_2885,c_2823]) ).
tcf(c_11578,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),X2),divide(divide(X0,X2),X1)),
inference(superposition,[status(thm)],[c_5209,c_75]) ).
tcf(c_11984,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( divide(divide(X0,X1),X2) = divide(divide(X0,X2),X1) )
| ~ less_equal(divide(divide(X0,X1),X2),divide(divide(X0,X2),X1)) ),
inference(superposition,[status(thm)],[c_11578,c_70]) ).
tcf(c_12035,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),X2) = divide(divide(X0,X2),X1),
inference(forward_subsumption_resolution,[status(thm)],[c_11984,c_11578]) ).
tcf(c_26719,plain,
! [X0: $i,X1: $i] : divide(divide(identity,X0),divide(identity,divide(identity,X1))) = divide(divide(identity,X1),X0),
inference(superposition,[status(thm)],[c_79,c_12035]) ).
tcf(c_27325,plain,
divide(divide(identity,b),divide(identity,divide(identity,a))) != divide(divide(identity,b),a),
inference(demodulation,[status(thm)],[c_67,c_26719]) ).
tcf(c_29528,plain,
$false,
inference(ground_joinability,[status(thm)],[c_27325,c_12035,c_26719]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 16:18:39 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 10.50/2.15 % SZS status Started for theBenchmark.p
% 10.50/2.15 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.15
% 10.50/2.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.50/2.15
% 10.50/2.15 % ------ iProver source info
% 10.50/2.15
% 10.50/2.15 % git: date: 2026-07-19 20:42:38 +0200
% 10.50/2.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.50/2.15 % git: non_committed_changes: false
% 10.50/2.15
% 10.50/2.15 % ------ Parsing...% successful
% 10.50/2.15
% 10.50/2.15
% 10.50/2.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.50/2.15
% 10.50/2.15 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 10.50/2.15
% 10.50/2.15 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.50/2.15
% 10.50/2.15 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.50/2.15 % ------ Proving...
% 10.50/2.15 % ------ Problem Properties
% 10.50/2.15
% 10.50/2.15 %
% 10.50/2.15 % clauses 18
% 10.50/2.15 % conjectures 1
% 10.50/2.15 % EPR 4
% 10.50/2.15 % Horn 18
% 10.50/2.15 % unary 11
% 10.50/2.15 % binary 5
% 10.50/2.15 % lits 27
% 10.50/2.15 % lits eq 10
% 10.50/2.15 % fd_pure 0
% 10.50/2.15 % fd_pseudo 0
% 10.50/2.15 % fd_cond 0
% 10.50/2.15 % fd_pseudo_cond 1
% 10.50/2.15 % AC symbols 0
% 10.50/2.15
% 10.50/2.15 % ------ Schedule dynamic 5 is on
% 10.50/2.15
% 10.50/2.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.50/2.15
% 10.50/2.15
% 10.50/2.15 % ------
% 10.50/2.15 % Current options:
% 10.50/2.15 % ------
% 10.50/2.15
% 10.50/2.15
% 10.50/2.15 %
% 10.50/2.15
% 10.50/2.15 % ------ Proving...
% 10.50/2.15 %
% 10.50/2.15
% 10.50/2.15 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.15
% 10.50/2.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.50/2.15
% 10.50/2.15
%------------------------------------------------------------------------------