%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN005-6 : 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 : n027.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:31 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 20 unt; 0 nHn; 19 RR)
% Number of literals : 34 ( 12 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(a_LE_b,hypothesis,
less_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(b_LE_c,hypothesis,
less_equal(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_LE_c) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(prove_a_LE_c,negated_conjecture,
~ less_equal(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_LE_c) ).
cnf(c_0_9,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_10,hypothesis,
less_equal(a,b),
a_LE_b ).
cnf(c_0_11,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_12,hypothesis,
divide(a,b) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_14,hypothesis,
less_equal(b,c),
b_LE_c ).
cnf(c_0_15,hypothesis,
less_equal(divide(divide(a,X1),divide(b,X1)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,hypothesis,
divide(b,c) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_18,hypothesis,
less_equal(divide(divide(a,c),zero),zero),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_20,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_21,hypothesis,
divide(divide(a,c),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,hypothesis,
less_equal(divide(a,c),zero),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,hypothesis,
divide(a,c) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
~ less_equal(a,c),
prove_a_LE_c ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : HEN005-6 : TPTP v9.2.1. Released v1.0.0.
% 0.13/0.13 % 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.15/0.33 % Computer : n027.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 19:09:20 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.366s
%------------------------------------------------------------------------------