%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN003-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 : n018.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:19 PM UTC 2026
% Result : Unsatisfiable 3.30s 1.24s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 20 unt; 1 def)
% Number of atoms : 53 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 29 !; 0 ?; 17 :)
% 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,negated_conjecture,
divide(a,a) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
fof(f13,plain,
zero != divide(a,a),
inference(reorient_equations,[],[f12]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,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_63,plain,
! [X0: $i] : less_equal(zero,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_68,negated_conjecture,
divide(a,a) != zero,
inference(cnf_transformation,[],[f13]) ).
tcf(c_140,definition,
iPr_def_10 = divide(a,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_141,negated_conjecture,
iPr_def_10 != zero,
inference(demodulation,[status(thm)],[c_68,c_140]) ).
tcf(c_315,plain,
less_equal(iPr_def_10,a),
inference(superposition,[status(thm)],[c_140,c_61]) ).
tcf(c_318,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_61,c_59]) ).
tcf(c_321,plain,
divide(iPr_def_10,a) = zero,
inference(superposition,[status(thm)],[c_315,c_59]) ).
tcf(c_339,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_63,c_64]) ).
tcf(c_380,plain,
( ( iPr_def_10 = zero )
| ~ less_equal(iPr_def_10,zero)
| ~ less_equal(zero,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_392,plain,
less_equal(zero,iPr_def_10),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_406,plain,
! [X0: $i,X1: $i] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_318,c_62]) ).
tcf(c_457,plain,
less_equal(divide(divide(a,a),zero),zero),
inference(superposition,[status(thm)],[c_321,c_406]) ).
tcf(c_461,plain,
less_equal(divide(iPr_def_10,zero),zero),
inference(light_normalisation,[status(thm)],[c_457,c_140]) ).
tcf(c_472,plain,
( less_equal(iPr_def_10,zero)
| ( divide(iPr_def_10,zero) != zero ) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_476,plain,
divide(iPr_def_10,zero) = zero,
inference(superposition,[status(thm)],[c_461,c_339]) ).
tcf(c_478,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_476,c_472,c_392,c_380,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN003-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.34 % Computer : n018.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Wed Sep 23 16:12:18 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.38 Running first-order theorem proving
% 0.07/0.38 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.13/0.39
% 0.13/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39
% 0.13/0.39 % Detected problem language: tptp
% 0.13/0.40 % Proving...
% 3.30/1.24 % SZS status Started for theBenchmark.p
% 3.30/1.24 % SZS status Unsatisfiable for theBenchmark.p
% 3.30/1.24
% 3.30/1.24 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/1.24
% 3.30/1.24 % ------ iProver source info
% 3.30/1.24
% 3.30/1.24 % git: date: 2026-07-19 20:42:38 +0200
% 3.30/1.24 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/1.24 % git: non_committed_changes: false
% 3.30/1.24
% 3.30/1.24 % ------ Parsing...% successful
% 3.30/1.24
% 3.30/1.24
% 3.30/1.24 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.30/1.24
% 3.30/1.24 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.30/1.24
% 3.30/1.24 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.30/1.24
% 3.30/1.24 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.30/1.24 % ------ Proving...
% 3.30/1.24 % ------ Problem Properties
% 3.30/1.24
% 3.30/1.24 %
% 3.30/1.24 % clauses 11
% 3.30/1.24 % conjectures 1
% 3.30/1.24 % EPR 4
% 3.30/1.24 % Horn 11
% 3.30/1.24 % unary 8
% 3.30/1.24 % binary 2
% 3.30/1.24 % lits 15
% 3.30/1.24 % lits eq 7
% 3.30/1.24 % fd_pure 0
% 3.30/1.24 % fd_pseudo 0
% 3.30/1.24 % fd_cond 0
% 3.30/1.24 % fd_pseudo_cond 1
% 3.30/1.24 % AC symbols 0
% 3.30/1.24
% 3.30/1.24 % ------ Schedule dynamic 5 is on
% 3.30/1.24
% 3.30/1.24 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.30/1.24
% 3.30/1.24
% 3.30/1.24 % ------
% 3.30/1.24 % Current options:
% 3.30/1.24 % ------
% 3.30/1.24
% 3.30/1.24
% 3.30/1.24 %
% 3.30/1.24
% 3.30/1.24 % ------ Proving...
% 3.30/1.24 %
% 3.30/1.24
% 3.30/1.24 % SZS status Unsatisfiable for theBenchmark.p
% 3.30/1.24
% 3.30/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/1.24
% 3.30/1.24
%------------------------------------------------------------------------------