%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : HEN003-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:36:57 PM UTC 2026
% Result : Unsatisfiable 4.66s 1.11s
% Output : Proof 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 42 unt; 0 def)
% Number of atoms : 54 ( 53 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 69 ( 12 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,axiom,
( X = Y
| divide(Y,X) != zero
| divide(X,Y) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_and_equal) ).
fof(f3_nnf,plain,
! [X,Y] :
( X = Y
| divide(Y,X) != zero
| divide(X,Y) != zero ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y] :
( X = Y
| divide(Y,X) != zero
| divide(X,Y) != zero ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( X0 = X1
| divide(X1,X0) != zero
| divide(X0,X1) != zero ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t5,plain,
ifeq(divide(X1,X2),zero,ifeq(divide(X2,X1),zero,X1,X2),X2) = X2,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t7,plain,
ifeq(divide(X1,X2),zero,ifeq(divide(X2,X1),zero,X1,X2),X2) = X2,
inference(orient,[status(thm)],[t5]) ).
cnf(f2,axiom,
divide(zero,X) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
fof(f2_nnf,plain,
! [X] : divide(zero,X) = zero,
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] : divide(zero,X) = zero,
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
divide(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t1,plain,
divide(zero,X1) = zero,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t30,plain,
divide(zero,X1) = zero,
inference(orient,[status(thm)],[t1]) ).
cnf(t32,plain,
zero = ifeq(divide(X1,zero),zero,ifeq(zero,zero,X1,zero),zero),
inference(cp,[status(thm)],[t7,t30]) ).
cnf(t3,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t6,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t3]) ).
cnf(t69,plain,
zero = ifeq(divide(X1,zero),zero,X1,zero),
inference(step,[status(thm)],[t32,t6]) ).
cnf(t37,plain,
ifeq(divide(X1,zero),zero,X1,zero) = zero,
inference(orient,[status(thm)],[t69]) ).
cnf(f1,axiom,
divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
fof(f1_nnf,plain,
! [X,Z,Y] : divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero,
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Z,Y] : divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero,
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t4,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t16,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
inference(orient,[status(thm)],[t4]) ).
cnf(f0,axiom,
divide(divide(X,Y),X) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_smaller_than_numerator) ).
fof(f0_nnf,plain,
! [X,Y] : divide(divide(X,Y),X) = zero,
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] : divide(divide(X,Y),X) = zero,
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
divide(divide(X0,X1),X0) = zero,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
divide(divide(X1,X2),X1) = zero,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t11,plain,
divide(divide(X1,X2),X1) = zero,
inference(orient,[status(thm)],[t2]) ).
cnf(t20,plain,
zero = divide(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(cp,[status(thm)],[t16,t11]) ).
cnf(t38,plain,
divide(divide(divide(X1,X1),divide(X2,X1)),zero) = zero,
inference(orient,[status(thm)],[t20]) ).
cnf(t39,plain,
zero = divide(divide(divide(X1,X1),zero),zero),
inference(cp,[status(thm)],[t38,t30]) ).
cnf(t49,plain,
divide(divide(divide(X1,X1),zero),zero) = zero,
inference(orient,[status(thm)],[t39]) ).
cnf(t50,plain,
zero = ifeq(zero,zero,divide(divide(X1,X1),zero),zero),
inference(cp,[status(thm)],[t37,t49]) ).
cnf(t70,plain,
zero = divide(divide(X1,X1),zero),
inference(step,[status(thm)],[t50,t6]) ).
cnf(t56,plain,
divide(divide(X1,X1),zero) = zero,
inference(orient,[status(thm)],[t70]) ).
cnf(t57,plain,
zero = ifeq(zero,zero,divide(X1,X1),zero),
inference(cp,[status(thm)],[t37,t56]) ).
cnf(t71,plain,
zero = divide(X1,X1),
inference(step,[status(thm)],[t57,t6]) ).
cnf(t63,plain,
divide(X1,X1) = zero,
inference(orient,[status(thm)],[t71]) ).
cnf(f5,negated_conjecture,
divide(a,a) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
fof(f5_nnf,plain,
divide(a,a) != zero,
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
divide(a,a) != zero,
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
divide(a,a) != zero,
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(goal_0,negated_conjecture,
divide(a,a) != zero,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
zero != zero,
inference(rw,[status(thm)],[goal_0,t63]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN003-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 16:14:40 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.66/1.11 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.66/1.11 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------