%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN012-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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 1.59s 16.09s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 15 unt; 0 def)
% Number of atoms : 99 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 37 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 78 ( 0 sgn 78 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
fof(f2,axiom,
! [X0,X1] :
( less_equal(X0,X1)
| ~ quotient(X0,X1,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
fof(f3,axiom,
! [X2,X0,X1] :
( less_equal(X2,X0)
| ~ quotient(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( less_equal(X6,X7)
| ~ quotient(X2,X3,X7)
| ~ quotient(X5,X4,X6)
| ~ quotient(X0,X3,X5)
| ~ quotient(X1,X3,X4)
| ~ quotient(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
fof(f5,axiom,
! [X0] : less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
fof(f10,negated_conjecture,
~ less_equal(x,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_X_less_than_or_equal_to_X) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ~ quotient(X0,X1,zero) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ~ quotient(X0,X1,X2) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( less_equal(X7,X6)
| ~ quotient(X4,X5,X7)
| ~ quotient(X2,X3,X6)
| ~ quotient(X1,X3,X5)
| ~ quotient(X0,X3,X4)
| ~ quotient(X0,X1,X2) ),
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,
~ less_equal(x,x),
inference(cnf_transformation,[],[f10]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_59]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(well_definedness,[status(thm)],[c_60]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ( divide(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_61]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( less_equal(X7,X6)
| ( divide(X4,X5) != X7 )
| ( divide(X2,X3) != X6 )
| ( divide(X1,X3) != X5 )
| ( divide(X0,X3) != X4 )
| ( divide(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_62]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( divide(X0,X1) != X2 )
| less_equal(X2,X0) ),
inference(prop_impl_just,[status(thm)],[c_77]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ( divide(X0,X1) != X2 ) ),
inference(renaming,[status(thm)],[c_89]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_90]) ).
tcf(c_174,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_79]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) != zero )
| less_equal(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_76]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(renaming,[status(thm)],[c_182]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_75]) ).
tcf(c_240,negated_conjecture,
~ less_equal(x,x),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_401,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_160,c_184]) ).
tcf(c_434,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_63,c_64]) ).
tcf(c_458,plain,
! [X0: $i,X1: $i] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_401,c_174]) ).
tcf(c_488,plain,
! [X0: $i] : less_equal(divide(divide(X0,X0),zero),zero),
inference(superposition,[status(thm)],[c_401,c_458]) ).
tcf(c_502,plain,
! [X0: $i] : divide(divide(X0,X0),zero) = zero,
inference(superposition,[status(thm)],[c_488,c_434]) ).
tcf(c_508,plain,
! [X0: $i] : less_equal(divide(X0,X0),zero),
inference(superposition,[status(thm)],[c_502,c_183]) ).
tcf(c_523,plain,
! [X0: $i] : divide(X0,X0) = zero,
inference(superposition,[status(thm)],[c_508,c_434]) ).
tcf(c_528,plain,
! [X0: $i] : less_equal(X0,X0),
inference(superposition,[status(thm)],[c_523,c_183]) ).
tcf(c_536,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_240,c_528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN012-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/15.39 % Computer : n006.cluster.edu
% 0.12/15.39 % Model : x86_64 x86_64
% 0.12/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.39 % Memory : 8046.5625MB
% 0.12/15.39 % OS : Linux 6.8.0-71-generic
% 0.12/15.39 % CPULimit : 300
% 0.12/15.39 % WCLimit : 300
% 0.12/15.39 % DateTime : Wed Sep 23 16:18:28 UTC 2026
% 0.12/15.40 % CPUTime :
% 0.12/15.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/15.43 Running first-order theorem proving
% 0.16/15.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/15.44
% 0.16/15.44 % ======== iProver multi-core TPTP/SMT =========
% 0.16/15.44
% 0.16/15.44 % Detected problem language: tptp
% 0.16/15.45 % Proving...
% 1.59/16.09 % SZS status Started for theBenchmark.p
% 1.59/16.09 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/16.09
% 1.59/16.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/16.09
% 1.59/16.09 % ------ iProver source info
% 1.59/16.09
% 1.59/16.09 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/16.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/16.09 % git: non_committed_changes: false
% 1.59/16.09
% 1.59/16.09 % ------ Parsing...% successful
% 1.59/16.09
% 1.59/16.09
% 1.59/16.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/16.09
% 1.59/16.09 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.59/16.09
% 1.59/16.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.59/16.09
% 1.59/16.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.59/16.09 % ------ Proving...
% 1.59/16.09 % ------ Problem Properties
% 1.59/16.09
% 1.59/16.09 %
% 1.59/16.09 % clauses 8
% 1.59/16.09 % conjectures 1
% 1.59/16.09 % EPR 4
% 1.59/16.09 % Horn 8
% 1.59/16.09 % unary 5
% 1.59/16.09 % binary 2
% 1.59/16.09 % lits 12
% 1.59/16.09 % lits eq 3
% 1.59/16.09 % fd_pure 0
% 1.59/16.09 % fd_pseudo 0
% 1.59/16.09 % fd_cond 0
% 1.59/16.09 % fd_pseudo_cond 1
% 1.59/16.09 % AC symbols 0
% 1.59/16.09
% 1.59/16.09 % ------ Schedule dynamic 5 is on
% 1.59/16.09
% 1.59/16.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.59/16.09
% 1.59/16.09
% 1.59/16.09 % ------
% 1.59/16.09 % Current options:
% 1.59/16.09 % ------
% 1.59/16.09
% 1.59/16.09
% 1.59/16.09 %
% 1.59/16.09
% 1.59/16.09 % ------ Proving...
% 1.59/16.09 %
% 1.59/16.09
% 1.59/16.09 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/16.09
% 1.59/16.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/16.09
% 1.59/16.09
%------------------------------------------------------------------------------