%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HEN007-5 : 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 : n007.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.55s 3.10s
% Output : CNFRefutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 16 unt; 0 nHn; 15 RR)
% Number of literals : 40 ( 39 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divide_and_equal,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).
cnf(quotient_property,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_property) ).
cnf(quotient_smaller_than_numerator,axiom,
divide(divide(X1,X2),X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',quotient_smaller_than_numerator) ).
cnf(zero_is_smallest,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).
cnf(transitivity_of_divide_to_zero,axiom,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_divide_to_zero) ).
cnf(a_divide_b_is_zero,hypothesis,
divide(a,b) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_divide_b_is_zero) ).
cnf(prove_property_of_divide2,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_divide2) ).
cnf(c_0_7,axiom,
( X1 = X2
| divide(X1,X2) != zero
| divide(X2,X1) != zero ),
divide_and_equal ).
cnf(c_0_8,axiom,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
quotient_property ).
cnf(c_0_9,axiom,
divide(divide(X1,X2),X1) = zero,
quotient_smaller_than_numerator ).
cnf(c_0_10,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| divide(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) != zero ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
divide(zero,X1) = zero,
zero_is_smallest ).
cnf(c_0_12,axiom,
( divide(X1,X3) = zero
| divide(X1,X2) != zero
| divide(X2,X3) != zero ),
transitivity_of_divide_to_zero ).
cnf(c_0_13,hypothesis,
divide(a,b) = zero,
a_divide_b_is_zero ).
cnf(c_0_14,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
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_10,c_0_9]),c_0_11])]) ).
cnf(c_0_16,hypothesis,
( divide(X1,b) = zero
| divide(X1,a) != zero ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
divide(X1,X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9]) ).
cnf(c_0_18,plain,
( divide(X1,X2) = zero
| divide(X1,divide(X2,X3)) != zero ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_19,hypothesis,
( divide(divide(X1,b),divide(X2,b)) = zero
| divide(divide(X1,X2),a) != zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_11])]) ).
cnf(c_0_20,plain,
divide(divide(X1,divide(X1,X2)),divide(X2,divide(X1,X2))) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_11])]) ).
cnf(c_0_21,hypothesis,
( divide(divide(X1,b),X2) = zero
| divide(divide(X1,X2),a) != zero ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(X1,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
divide(divide(c,b),divide(c,a)) != zero,
prove_property_of_divide2 ).
cnf(c_0_24,hypothesis,
divide(divide(X1,b),divide(X1,a)) = zero,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN007-5 : 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 : n007.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:08:09 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 3.55/3.10 % Version : CSE_E---1.7
% 3.55/3.10 % Problem : theBenchmark.p
% 3.55/3.10 % SZS status Unsatisfiable for theBenchmark.p
% 3.55/3.10 % SZS output start CNFRefutation
% See solution above
% 3.55/3.11 % Total time : 2.369s
%------------------------------------------------------------------------------