%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN004-3 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.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:30 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 22 unt; 0 nHn; 10 RR)
% Number of literals : 38 ( 16 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(prove_x_divide_zero_is_x,negated_conjecture,
divide(a,zero) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divide_zero_is_x) ).
cnf(c_0_7,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_8,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_9,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_10,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_12,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_14,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_15,plain,
divide(divide(X1,X1),divide(X2,X1)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_18,plain,
less_equal(divide(X1,X1),divide(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,zero),X2)),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_20,plain,
divide(X1,X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10]) ).
cnf(c_0_21,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_13])]) ).
cnf(c_0_23,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_24,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_13])]) ).
cnf(c_0_25,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
divide(a,zero) != a,
prove_x_divide_zero_is_x ).
cnf(c_0_27,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_8])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN004-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 19:09:10 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.374s
%------------------------------------------------------------------------------