%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN010-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 : n020.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:35 PM UTC 2026
% Result : Unsatisfiable 9.95s 7.01s
% Output : CNFRefutation 10.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 24 unt; 0 nHn; 43 RR)
% Number of literals : 118 ( 7 equ; 66 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 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 : 111 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(xQyLEz_implies_xQzLEy,axiom,
( less_equal(X5,X2)
| ~ quotient(X1,X2,X3)
| ~ less_equal(X3,X4)
| ~ quotient(X1,X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz_implies_xQzLEy) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(xLEy_implies_xQzLEyQz,axiom,
( less_equal(X4,X5)
| ~ less_equal(X1,X2)
| ~ quotient(X1,X3,X4)
| ~ quotient(X2,X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy_implies_xQzLEyQz) ).
cnf(identity_divide_idQa,hypothesis,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQa) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',identity_is_largest) ).
cnf(xLEy_implies_zQyLEzQx,axiom,
( less_equal(X4,X5)
| ~ less_equal(X1,X2)
| ~ quotient(X3,X2,X4)
| ~ quotient(X3,X1,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy_implies_zQyLEzQx) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_a) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divde_zero_is_x) ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).
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(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(transitivity_of_less_equal,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(x_divide_x_is_zero,axiom,
quotient(X1,X1,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
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(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
cnf(c_0_16,axiom,
( less_equal(X5,X2)
| ~ quotient(X1,X2,X3)
| ~ less_equal(X3,X4)
| ~ quotient(X1,X4,X5) ),
xQyLEz_implies_xQzLEy ).
cnf(c_0_17,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_18,axiom,
( less_equal(X4,X5)
| ~ less_equal(X1,X2)
| ~ quotient(X1,X3,X4)
| ~ quotient(X2,X3,X5) ),
xLEy_implies_xQzLEyQz ).
cnf(c_0_19,hypothesis,
quotient(identity,idQa,idQ_idQa),
identity_divide_idQa ).
cnf(c_0_20,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_21,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X1,X3,X4)
| ~ less_equal(X4,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
( less_equal(X1,idQ_idQa)
| ~ quotient(X2,idQa,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
( less_equal(divide(X1,X2),X3)
| ~ less_equal(divide(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_24,hypothesis,
less_equal(divide(X1,idQa),idQ_idQa),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_25,axiom,
( less_equal(X4,X5)
| ~ less_equal(X1,X2)
| ~ quotient(X3,X2,X4)
| ~ quotient(X3,X1,X5) ),
xLEy_implies_zQyLEzQx ).
cnf(c_0_26,hypothesis,
quotient(identity,a,idQa),
identity_divide_a ).
cnf(c_0_27,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_28,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_29,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
identity_divide_idQ_idQa ).
cnf(c_0_30,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_31,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_32,hypothesis,
less_equal(divide(X1,idQ_idQa),idQa),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,hypothesis,
( less_equal(idQa,X1)
| ~ quotient(identity,X2,X1)
| ~ less_equal(X2,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,hypothesis,
( less_equal(idQ_idQa,X1)
| ~ quotient(identity,X1,X2)
| ~ less_equal(X2,idQa) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_35,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
transitivity_of_less_equal ).
cnf(c_0_37,hypothesis,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_38,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_30,c_0_28]) ).
cnf(c_0_39,axiom,
quotient(X1,X1,zero),
x_divide_x_is_zero ).
cnf(c_0_40,hypothesis,
( divide(X1,idQ_idQa) = idQa
| ~ less_equal(idQa,divide(X1,idQ_idQa)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,hypothesis,
( less_equal(idQa,divide(identity,X1))
| ~ less_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_33,c_0_17]) ).
cnf(c_0_42,hypothesis,
less_equal(idQ_idQa,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_35])]) ).
cnf(c_0_43,hypothesis,
( less_equal(X1,idQa)
| ~ less_equal(X1,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_45,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X4,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,hypothesis,
divide(identity,idQ_idQa) = idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_47,hypothesis,
( less_equal(X1,idQa)
| ~ quotient(X1,idQa_Q__idQ_idQa,zero) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,hypothesis,
( less_equal(X1,idQa_Q__idQ_idQa)
| ~ quotient(X2,idQ_idQa,idQa)
| ~ quotient(X2,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_49,hypothesis,
quotient(identity,idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_50,hypothesis,
( idQa = X1
| ~ quotient(X1,idQa_Q__idQ_idQa,zero)
| ~ less_equal(idQa,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_51,hypothesis,
( less_equal(X1,idQa_Q__idQ_idQa)
| ~ quotient(identity,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
prove_idQa_equals_idQa_Q__idQ_idQa ).
cnf(c_0_53,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_39]),c_0_49])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN010-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.16/0.34 % Computer : n020.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon May 4 19:09:50 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 9.95/7.01 % Version : CSE_E---1.7
% 9.95/7.01 % Problem : theBenchmark.p
% 9.95/7.01 % SZS status Unsatisfiable for theBenchmark.p
% 9.95/7.01 % SZS output start CNFRefutation
% See solution above
% 10.07/7.05 % Total time : 5.370s
%------------------------------------------------------------------------------