%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN009-4 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n028.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:34 PM UTC 2026
% Result : Unsatisfiable 1.72s 1.89s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 27 unt; 0 nHn; 12 RR)
% Number of literals : 55 ( 18 equ; 17 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
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(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
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(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(property_of_divide2,axiom,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide2) ).
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(property_of_divide3,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide3) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
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(prove_this,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_12,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_13,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_14,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_15,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_16,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( X1 = zero
| ~ less_equal(X1,zero) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
less_equal(divide(X1,divide(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
property_of_divide2 ).
cnf(c_0_20,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_21,plain,
divide(X1,divide(X1,zero)) = zero,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
less_equal(divide(X1,X2),divide(X1,divide(X2,X3))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
property_of_divide3 ).
cnf(c_0_25,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_26,plain,
( divide(X1,divide(X2,X3)) = divide(X1,X2)
| ~ less_equal(divide(X1,divide(X2,X3)),divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_27,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_28,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_20])]) ).
cnf(c_0_29,plain,
less_equal(divide(X1,X2),divide(identity,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
less_equal(divide(divide(X1,divide(X1,X2)),X3),divide(X2,X3)),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_31,plain,
divide(divide(X1,X2),X2) = divide(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_12]),c_0_28]) ).
cnf(c_0_32,plain,
( divide(identity,X1) = divide(X2,X1)
| ~ less_equal(divide(identity,X1),divide(X2,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_33,plain,
less_equal(divide(X1,divide(X1,X2)),divide(X2,divide(X1,X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
divide(identity,divide(identity,X1)) = divide(X1,divide(identity,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
divide(divide(X1,X2),divide(X2,X3)) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_20])]) ).
cnf(c_0_36,plain,
divide(identity,divide(X1,divide(identity,X1))) = divide(identity,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_34]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
prove_this ).
cnf(c_0_38,plain,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN009-4 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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.16/0.33 % Computer : n028.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 19:10:01 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.72/1.89 % Version : CSE_E---1.7
% 1.72/1.89 % Problem : theBenchmark.p
% 1.72/1.89 % SZS status Unsatisfiable for theBenchmark.p
% 1.72/1.89 % SZS output start CNFRefutation
% See solution above
% 1.72/1.89 % Total time : 1.370s
%------------------------------------------------------------------------------