%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN006-7 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:28:32 PM UTC 2026
% Result : Unsatisfiable 3.91s 3.16s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 21 unt; 0 nHn; 37 RR)
% Number of literals : 99 ( 10 equ; 55 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 100 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(quotient_property,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(xQyLEz,hypothesis,
less_equal(xQy,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divde_zero_is_x) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(xQz,hypothesis,
quotient(x,z,xQz),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQz) ).
cnf(well_defined,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(xQy,hypothesis,
quotient(x,y,xQy),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQy) ).
cnf(prove_xQzLEy,negated_conjecture,
~ less_equal(xQz,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xQzLEy) ).
cnf(c_0_13,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
quotient_property ).
cnf(c_0_16,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
quotient_less_equal ).
cnf(c_0_17,hypothesis,
less_equal(xQy,z),
xQyLEz ).
cnf(c_0_18,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_19,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X4,X5,X3)
| ~ quotient(X6,X5,X2)
| ~ quotient(X7,X5,X1)
| ~ quotient(X7,X6,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,hypothesis,
quotient(xQy,z,zero),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,zero)
| ~ quotient(X5,X4,X2)
| ~ quotient(X6,X4,X1)
| ~ quotient(X6,X3,X5) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
quotient(divide(X1,X2),X1,zero),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,z,X2)
| ~ quotient(X4,z,X1)
| ~ quotient(X4,X3,xQy) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( less_equal(X1,X2)
| ~ quotient(X3,divide(X4,X5),X6)
| ~ quotient(X6,X4,X2)
| ~ quotient(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_27,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_28,hypothesis,
( less_equal(divide(X1,divide(X2,z)),zero)
| ~ quotient(X3,z,X1)
| ~ quotient(X3,X2,xQy) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_29,hypothesis,
quotient(x,z,xQz),
xQz ).
cnf(c_0_30,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
well_defined ).
cnf(c_0_31,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_32,plain,
( less_equal(X1,X2)
| ~ quotient(divide(X3,divide(X4,X5)),X4,X2)
| ~ quotient(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ quotient(X2,X1,zero)
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,hypothesis,
( less_equal(divide(xQz,divide(X1,z)),zero)
| ~ quotient(x,X1,xQy) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( X1 = zero
| ~ quotient(zero,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( less_equal(X1,divide(divide(X2,divide(X3,X4)),X3))
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_37,hypothesis,
( divide(xQz,divide(X1,z)) = zero
| ~ quotient(x,X1,xQy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
cnf(c_0_38,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_39,hypothesis,
( less_equal(X1,zero)
| ~ quotient(x,X2,xQy)
| ~ quotient(xQz,X2,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,hypothesis,
quotient(x,y,xQy),
xQy ).
cnf(c_0_41,hypothesis,
( less_equal(X1,zero)
| ~ quotient(xQz,y,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,hypothesis,
( X1 = zero
| ~ quotient(xQz,y,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_41]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
~ less_equal(xQz,y),
prove_xQzLEy ).
cnf(c_0_44,hypothesis,
divide(xQz,y) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_14]) ).
cnf(c_0_45,negated_conjecture,
~ quotient(xQz,y,zero),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN006-7 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.33 % Computer : n001.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Mon May 4 19:10:33 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.35 % start to proof: theBenchmark
% 3.91/3.16 % Version : CSE_E---1.7
% 3.91/3.16 % Problem : theBenchmark.p
% 3.91/3.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.91/3.16 % SZS output start CNFRefutation
% See solution above
% 3.91/3.17 % Total time : 2.369s
%------------------------------------------------------------------------------