%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : HEN003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n012.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:56 PM UTC 2026
% Result : Unsatisfiable 10.30s 1.89s
% Output : Proof 10.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 9
% Syntax : Number of formulae : 88 ( 68 unt; 0 def)
% Number of atoms : 128 ( 59 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 86 ( 46 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 2 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 208 ( 19 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f7,axiom,
quotient(X,Y,divide(X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure) ).
fof(f7_nnf,plain,
! [X,Y] : quotient(X,Y,divide(X,Y)),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [X,Y] : quotient(X,Y,divide(X,Y)),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
quotient(X0,X1,divide(X0,X1)),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(t3,plain,
quotient(X1,X2,divide(X1,X2)) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(t24,plain,
quotient(X1,X2,divide(X1,X2)) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(f5,axiom,
( X = Y
| ~ less_equal(Y,X)
| ~ less_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_equal_and_equal) ).
fof(f5_nnf,plain,
! [X,Y] :
( X = Y
| ~ less_equal(Y,X)
| ~ less_equal(X,Y) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] :
( X = Y
| ~ less_equal(Y,X)
| ~ less_equal(X,Y) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( X0 = X1
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t7,plain,
ifeq(less_equal(X1,X2),true,ifeq(less_equal(X2,X1),true,X1,X2),X2) = X2,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t14,plain,
ifeq(less_equal(X1,X2),true,ifeq(less_equal(X2,X1),true,X1,X2),X2) = X2,
inference(orient,[status(thm)],[t7]) ).
cnf(f4,axiom,
less_equal(zero,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_is_smallest) ).
fof(f4_nnf,plain,
! [X] : less_equal(zero,X),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X] : less_equal(zero,X),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
less_equal(zero,X0),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(t1,plain,
less_equal(zero,X1) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t40,plain,
less_equal(zero,X1) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t45,plain,
zero = ifeq(less_equal(X1,zero),true,ifeq(true,true,X1,zero),zero),
inference(cp,[status(thm)],[t14,t40]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t11,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t661,plain,
zero = ifeq(less_equal(X1,zero),true,X1,zero),
inference(step,[status(thm)],[t45,t11]) ).
cnf(t95,plain,
ifeq(less_equal(X1,zero),true,X1,zero) = zero,
inference(orient,[status(thm)],[t661]) ).
cnf(f1,axiom,
( less_equal(X,Y)
| ~ quotient(X,Y,zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_equal_quotient) ).
fof(f1_nnf,plain,
! [X,Y] :
( less_equal(X,Y)
| ~ quotient(X,Y,zero) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y] :
( less_equal(X,Y)
| ~ quotient(X,Y,zero) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( less_equal(X0,X1)
| ~ quotient(X0,X1,zero) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t6,plain,
ifeq(quotient(X1,X2,zero),true,less_equal(X1,X2),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t21,plain,
ifeq(quotient(X1,X2,zero),true,less_equal(X1,X2),true) = true,
inference(orient,[status(thm)],[t6]) ).
cnf(f3,axiom,
( less_equal(V4,V5)
| ~ quotient(V1,Z,V5)
| ~ quotient(V3,V2,V4)
| ~ quotient(X,Z,V3)
| ~ quotient(Y,Z,V2)
| ~ quotient(X,Y,V1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_property) ).
fof(f3_nnf,plain,
! [X,Y,V1,Z,V2,V3,V4,V5] :
( less_equal(V4,V5)
| ~ quotient(V1,Z,V5)
| ~ quotient(V3,V2,V4)
| ~ quotient(X,Z,V3)
| ~ quotient(Y,Z,V2)
| ~ quotient(X,Y,V1) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y,V1,Z,V2,V3,V4,V5] :
( less_equal(V4,V5)
| ~ quotient(V1,Z,V5)
| ~ quotient(V3,V2,V4)
| ~ quotient(X,Z,V3)
| ~ quotient(Y,Z,V2)
| ~ quotient(X,Y,V1) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( less_equal(X6,X7)
| ~ quotient(X2,X3,X7)
| ~ quotient(X5,X4,X6)
| ~ quotient(X0,X3,X5)
| ~ quotient(X1,X3,X4)
| ~ quotient(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t9,plain,
ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X2,X4,X5),true,ifeq(quotient(X1,X4,X6),true,ifeq(quotient(X6,X5,X7),true,ifeq(quotient(X3,X4,X8),true,less_equal(X7,X8),true),true),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t15,plain,
ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X2,X4,X5),true,ifeq(quotient(X1,X4,X6),true,ifeq(quotient(X6,X5,X7),true,ifeq(quotient(X3,X4,X8),true,less_equal(X7,X8),true),true),true),true),true) = true,
inference(orient,[status(thm)],[t9]) ).
cnf(t28,plain,
true = ifeq(true,true,ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X4,X2,X5),true,ifeq(quotient(X5,X3,X6),true,ifeq(quotient(divide(X4,X1),X2,X7),true,less_equal(X6,X7),true),true),true),true),true),
inference(cp,[status(thm)],[t15,t24]) ).
cnf(t736,plain,
true = ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X4,X2,X5),true,ifeq(quotient(X5,X3,X6),true,ifeq(quotient(divide(X4,X1),X2,X7),true,less_equal(X6,X7),true),true),true),true),
inference(step,[status(thm)],[t28,t11]) ).
cnf(t561,plain,
ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X4,X2,X5),true,ifeq(quotient(X5,X3,X6),true,ifeq(quotient(divide(X4,X1),X2,X7),true,less_equal(X6,X7),true),true),true),true) = true,
inference(orient,[status(thm)],[t736]) ).
cnf(f0,axiom,
( quotient(X,Y,zero)
| ~ less_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_less_equal) ).
fof(f0_nnf,plain,
! [X,Y] :
( quotient(X,Y,zero)
| ~ less_equal(X,Y) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( quotient(X,Y,zero)
| ~ less_equal(X,Y) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t4,plain,
ifeq(less_equal(X1,X2),true,quotient(X1,X2,zero),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t23,plain,
ifeq(less_equal(X1,X2),true,quotient(X1,X2,zero),true) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(f2,axiom,
( less_equal(Z,X)
| ~ quotient(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor_existence) ).
fof(f2_nnf,plain,
! [X,Y,Z] :
( less_equal(Z,X)
| ~ quotient(X,Y,Z) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y,Z] :
( less_equal(Z,X)
| ~ quotient(X,Y,Z) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( less_equal(X2,X0)
| ~ quotient(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t5,plain,
ifeq(quotient(X1,X2,X3),true,less_equal(X3,X1),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t18,plain,
ifeq(quotient(X1,X2,X3),true,less_equal(X3,X1),true) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(t25,plain,
true = ifeq(true,true,less_equal(divide(X1,X2),X1),true),
inference(cp,[status(thm)],[t18,t24]) ).
cnf(t654,plain,
true = less_equal(divide(X1,X2),X1),
inference(step,[status(thm)],[t25,t11]) ).
cnf(t74,plain,
less_equal(divide(X1,X2),X1) = true,
inference(orient,[status(thm)],[t654]) ).
cnf(t76,plain,
true = ifeq(true,true,quotient(divide(X1,X2),X1,zero),true),
inference(cp,[status(thm)],[t23,t74]) ).
cnf(t656,plain,
true = quotient(divide(X1,X2),X1,zero),
inference(step,[status(thm)],[t76,t11]) ).
cnf(t82,plain,
quotient(divide(X1,X2),X1,zero) = true,
inference(orient,[status(thm)],[t656]) ).
cnf(t573,plain,
true = ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X2,X2,X4),true,ifeq(quotient(X4,X3,X5),true,ifeq(true,true,less_equal(X5,zero),true),true),true),true),
inference(cp,[status(thm)],[t561,t82]) ).
cnf(t744,plain,
true = ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X2,X2,X4),true,ifeq(quotient(X4,X3,X5),true,less_equal(X5,zero),true),true),true),
inference(step,[status(thm)],[t573,t11]) ).
cnf(t589,plain,
ifeq(quotient(X1,X2,X3),true,ifeq(quotient(X2,X2,X4),true,ifeq(quotient(X4,X3,X5),true,less_equal(X5,zero),true),true),true) = true,
inference(orient,[status(thm)],[t744]) ).
cnf(t591,plain,
true = ifeq(true,true,ifeq(quotient(X1,X1,X2),true,ifeq(quotient(X2,zero,X3),true,less_equal(X3,zero),true),true),true),
inference(cp,[status(thm)],[t589,t82]) ).
cnf(t745,plain,
true = ifeq(quotient(X1,X1,X2),true,ifeq(quotient(X2,zero,X3),true,less_equal(X3,zero),true),true),
inference(step,[status(thm)],[t591,t11]) ).
cnf(t597,plain,
ifeq(quotient(X1,X1,X2),true,ifeq(quotient(X2,zero,X3),true,less_equal(X3,zero),true),true) = true,
inference(orient,[status(thm)],[t745]) ).
cnf(t598,plain,
true = ifeq(true,true,ifeq(quotient(divide(X1,X1),zero,X2),true,less_equal(X2,zero),true),true),
inference(cp,[status(thm)],[t597,t24]) ).
cnf(t746,plain,
true = ifeq(quotient(divide(X1,X1),zero,X2),true,less_equal(X2,zero),true),
inference(step,[status(thm)],[t598,t11]) ).
cnf(t600,plain,
ifeq(quotient(divide(X1,X1),zero,X2),true,less_equal(X2,zero),true) = true,
inference(orient,[status(thm)],[t746]) ).
cnf(t601,plain,
true = ifeq(true,true,less_equal(divide(divide(X1,X1),zero),zero),true),
inference(cp,[status(thm)],[t600,t24]) ).
cnf(t747,plain,
true = less_equal(divide(divide(X1,X1),zero),zero),
inference(step,[status(thm)],[t601,t11]) ).
cnf(t602,plain,
less_equal(divide(divide(X1,X1),zero),zero) = true,
inference(orient,[status(thm)],[t747]) ).
cnf(t603,plain,
zero = ifeq(true,true,divide(divide(X1,X1),zero),zero),
inference(cp,[status(thm)],[t95,t602]) ).
cnf(t748,plain,
zero = divide(divide(X1,X1),zero),
inference(step,[status(thm)],[t603,t11]) ).
cnf(t608,plain,
divide(divide(X1,X1),zero) = zero,
inference(orient,[status(thm)],[t748]) ).
cnf(t611,plain,
true = quotient(divide(X1,X1),zero,zero),
inference(cp,[status(thm)],[t24,t608]) ).
cnf(t613,plain,
quotient(divide(X1,X1),zero,zero) = true,
inference(orient,[status(thm)],[t611]) ).
cnf(t615,plain,
true = ifeq(true,true,less_equal(divide(X1,X1),zero),true),
inference(cp,[status(thm)],[t21,t613]) ).
cnf(t749,plain,
true = less_equal(divide(X1,X1),zero),
inference(step,[status(thm)],[t615,t11]) ).
cnf(t625,plain,
less_equal(divide(X1,X1),zero) = true,
inference(orient,[status(thm)],[t749]) ).
cnf(t626,plain,
zero = ifeq(true,true,divide(X1,X1),zero),
inference(cp,[status(thm)],[t95,t625]) ).
cnf(t750,plain,
zero = divide(X1,X1),
inference(step,[status(thm)],[t626,t11]) ).
cnf(t630,plain,
divide(X1,X1) = zero,
inference(orient,[status(thm)],[t750]) ).
cnf(t633,plain,
true = quotient(X1,X1,zero),
inference(cp,[status(thm)],[t24,t630]) ).
cnf(t637,plain,
quotient(X1,X1,zero) = true,
inference(orient,[status(thm)],[t633]) ).
cnf(f9,negated_conjecture,
~ quotient(x,x,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
fof(f9_nnf,plain,
~ quotient(x,x,zero),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
~ quotient(x,x,zero),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
~ quotient(x,x,zero),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(goal_0,negated_conjecture,
quotient(x,x,zero) != true,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t637]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : HEN003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Wed Sep 23 16:09:06 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.30/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.30/1.89 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------