%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN008-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 : n015.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:24 PM UTC 2026
% Result : Unsatisfiable 1.47s 6.28s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 23 unt; 3 def)
% Number of atoms : 47 ( 33 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 12 ~; 7 |; 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; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
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,axiom,
divide(a,b) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_is_zero) ).
fof(f11,plain,
zero = divide(a,b),
inference(reorient_equations,[],[f10]) ).
fof(f12,negated_conjecture,
divide(divide(a,c),divide(b,c)) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_property_of_divide3) ).
fof(f13,plain,
zero != divide(divide(a,c),divide(b,c)),
inference(reorient_equations,[],[f12]) ).
tcf(c_57,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_58,plain,
! [X0: $i] : divide(zero,X0) = zero,
inference(cnf_transformation,[],[f5]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( divide(X1,X0) != zero )
| ( divide(X0,X1) != zero ) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_61,plain,
divide(a,b) = zero,
inference(cnf_transformation,[],[f11]) ).
tcf(c_62,negated_conjecture,
divide(divide(a,c),divide(b,c)) != zero,
inference(cnf_transformation,[],[f13]) ).
tcf(c_92,definition,
iPr_def_10 = divide(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_93,definition,
iPr_def_11 = divide(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_94,definition,
iPr_def_12 = divide(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_95,negated_conjecture,
iPr_def_12 != zero,
inference(demodulation,[status(thm)],[c_62,c_93,c_92,c_94]) ).
tcf(c_150,plain,
! [X0: $i] : divide(divide(iPr_def_10,divide(X0,c)),divide(divide(a,X0),c)) = zero,
inference(superposition,[status(thm)],[c_92,c_57]) ).
tcf(c_243,plain,
! [X0: $i] :
( ( X0 = zero )
| ( divide(X0,zero) != zero ) ),
inference(superposition,[status(thm)],[c_58,c_59]) ).
tcf(c_698,plain,
divide(divide(iPr_def_10,divide(b,c)),divide(zero,c)) = zero,
inference(superposition,[status(thm)],[c_61,c_150]) ).
tcf(c_709,plain,
divide(iPr_def_12,divide(zero,c)) = zero,
inference(light_normalisation,[status(thm)],[c_698,c_93,c_94]) ).
tcf(c_738,plain,
divide(iPr_def_12,zero) = zero,
inference(demodulation,[status(thm)],[c_709,c_58]) ).
tcf(c_744,plain,
zero = iPr_def_12,
inference(superposition,[status(thm)],[c_738,c_243]) ).
tcf(c_768,plain,
iPr_def_12 != iPr_def_12,
inference(demodulation,[status(thm)],[c_95,c_744]) ).
tcf(c_769,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_768]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN008-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.37 % Computer : n015.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Wed Sep 23 16:18:16 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 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/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 1.47/6.28 % SZS status Started for theBenchmark.p
% 1.47/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.47/6.28
% 1.47/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.47/6.28
% 1.47/6.28 % ------ iProver source info
% 1.47/6.28
% 1.47/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.47/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.47/6.28 % git: non_committed_changes: false
% 1.47/6.28
% 1.47/6.28 % ------ Parsing...% successful
% 1.47/6.28
% 1.47/6.28
% 1.47/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.47/6.28
% 1.47/6.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.47/6.28
% 1.47/6.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.47/6.28
% 1.47/6.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.47/6.28 % ------ Proving...
% 1.47/6.28 % ------ Problem Properties
% 1.47/6.28
% 1.47/6.28 %
% 1.47/6.28 % clauses 10
% 1.47/6.28 % conjectures 1
% 1.47/6.28 % EPR 1
% 1.47/6.28 % Horn 10
% 1.47/6.28 % unary 9
% 1.47/6.28 % binary 0
% 1.47/6.28 % lits 12
% 1.47/6.28 % lits eq 12
% 1.47/6.28 % fd_pure 0
% 1.47/6.28 % fd_pseudo 0
% 1.47/6.28 % fd_cond 0
% 1.47/6.28 % fd_pseudo_cond 1
% 1.47/6.28 % AC symbols 0
% 1.47/6.28
% 1.47/6.28 % ------ Schedule dynamic 5 is on
% 1.47/6.28
% 1.47/6.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.47/6.28
% 1.47/6.28
% 1.47/6.28 % ------
% 1.47/6.28 % Current options:
% 1.47/6.28 % ------
% 1.47/6.28
% 1.47/6.28
% 1.47/6.28 %
% 1.47/6.28
% 1.47/6.28 % ------ Proving...
% 1.47/6.28 %
% 1.47/6.28
% 1.47/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.47/6.28
% 1.47/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.47/6.28
% 1.47/6.28
%------------------------------------------------------------------------------