%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN003-5 : 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:19 PM UTC 2026
% Result : Unsatisfiable 3.30s 1.19s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 20 unt; 1 def)
% Number of atoms : 45 ( 33 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : divide(divide(X0,X1),X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_smaller_than_numerator) ).
fof(f2,axiom,
! [X2,X0,X1] : divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
fof(f3,plain,
! [X2,X0,X1] : zero = divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X0] : divide(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
fof(f5,plain,
! [X0] : zero = divide(zero,X0),
inference(reorient_equations,[],[f4]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
| divide(X1,X0) != zero
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
fof(f7,plain,
! [X0,X1] :
( X0 = X1
| zero != divide(X1,X0)
| divide(X0,X1) != zero ),
inference(reorient_equations,[],[f6]) ).
fof(f10,negated_conjecture,
divide(a,a) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
fof(f11,plain,
zero != divide(a,a),
inference(reorient_equations,[],[f10]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i] : divide(zero,X0) = zero,
inference(cnf_transformation,[],[f5]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( divide(X1,X0) != zero )
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_60,negated_conjecture,
divide(a,a) != zero,
inference(cnf_transformation,[],[f11]) ).
tcf(c_88,definition,
iPr_def_10 = divide(a,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_89,negated_conjecture,
iPr_def_10 != zero,
inference(demodulation,[status(thm)],[c_60,c_88]) ).
tcf(c_127,plain,
divide(iPr_def_10,a) = zero,
inference(superposition,[status(thm)],[c_88,c_55]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] : divide(divide(divide(X0,X0),divide(X1,X0)),zero) = zero,
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_187,plain,
( ( iPr_def_10 = zero )
| ( divide(iPr_def_10,zero) != zero )
| ( divide(zero,iPr_def_10) != zero ) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_189,plain,
divide(zero,iPr_def_10) = zero,
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_205,plain,
divide(divide(divide(a,a),zero),zero) = zero,
inference(superposition,[status(thm)],[c_127,c_146]) ).
tcf(c_213,plain,
divide(divide(iPr_def_10,zero),zero) = zero,
inference(light_normalisation,[status(thm)],[c_205,c_88]) ).
tcf(c_342,plain,
( ( divide(iPr_def_10,zero) = zero )
| ( divide(zero,divide(iPr_def_10,zero)) != zero ) ),
inference(superposition,[status(thm)],[c_213,c_58]) ).
tcf(c_348,plain,
divide(iPr_def_10,zero) = zero,
inference(ground_joinability,[status(thm)],[c_342,c_57]) ).
tcf(c_351,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_348,c_189,c_187,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN003-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n007.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % 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:07:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 3.30/1.19 % SZS status Started for theBenchmark.p
% 3.30/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.30/1.19
% 3.30/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/1.19
% 3.30/1.19 % ------ iProver source info
% 3.30/1.19
% 3.30/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.30/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/1.19 % git: non_committed_changes: false
% 3.30/1.19
% 3.30/1.19 % ------ Parsing...% successful
% 3.30/1.19
% 3.30/1.19
% 3.30/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.30/1.19
% 3.30/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.30/1.19
% 3.30/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.30/1.19
% 3.30/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.30/1.19 % ------ Proving...
% 3.30/1.19 % ------ Problem Properties
% 3.30/1.19
% 3.30/1.19 %
% 3.30/1.19 % clauses 7
% 3.30/1.19 % conjectures 1
% 3.30/1.19 % EPR 1
% 3.30/1.19 % Horn 7
% 3.30/1.19 % unary 6
% 3.30/1.19 % binary 0
% 3.30/1.19 % lits 9
% 3.30/1.19 % lits eq 9
% 3.30/1.19 % fd_pure 0
% 3.30/1.19 % fd_pseudo 0
% 3.30/1.19 % fd_cond 0
% 3.30/1.19 % fd_pseudo_cond 1
% 3.30/1.19 % AC symbols 0
% 3.30/1.19
% 3.30/1.19 % ------ Schedule dynamic 5 is on
% 3.30/1.19
% 3.30/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.30/1.19
% 3.30/1.19
% 3.30/1.19 % ------
% 3.30/1.19 % Current options:
% 3.30/1.19 % ------
% 3.30/1.19
% 3.30/1.19
% 3.30/1.19 %
% 3.30/1.19
% 3.30/1.19 % ------ Proving...
% 3.30/1.19 %
% 3.30/1.19
% 3.30/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.30/1.19
% 3.30/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/1.19
% 3.30/1.19
%------------------------------------------------------------------------------