%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : HEN001-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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:55 PM UTC 2026
% Result : Unsatisfiable 5.50s 1.22s
% Output : Proof 5.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 24 unt; 0 def)
% Number of atoms : 32 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 11 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 24 ( 6 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(t8,axiom,
sFlat0 = divide(a,identity),
introduced(definition) ).
cnf(t28,plain,
divide(a,identity) = sFlat0,
inference(orient,[status(thm)],[t8]) ).
cnf(f0,axiom,
( divide(X,Y) = zero
| ~ less_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_less_equal1) ).
fof(f0_nnf,plain,
! [X,Y] :
( divide(X,Y) = zero
| ~ less_equal(X,Y) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( divide(X,Y) = zero
| ~ less_equal(X,Y) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( divide(X0,X1) = zero
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t5,plain,
ifeq(less_equal(X1,X2),true,divide(X1,X2),zero) = zero,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t34,plain,
ifeq(less_equal(X1,X2),true,divide(X1,X2),zero) = zero,
inference(orient,[status(thm)],[t5]) ).
cnf(t39,plain,
zero = ifeq(less_equal(a,identity),true,sFlat0,zero),
inference(cp,[status(thm)],[t34,t28]) ).
cnf(f6,axiom,
less_equal(X,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_is_largest) ).
fof(f6_nnf,plain,
! [X] : less_equal(X,identity),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X] : less_equal(X,identity),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
less_equal(X0,identity),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(t0,plain,
less_equal(X1,identity) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(t11,plain,
less_equal(X1,identity) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t44,plain,
zero = ifeq(true,true,sFlat0,zero),
inference(step,[status(thm)],[t39,t11]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t9,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t45,plain,
zero = sFlat0,
inference(step,[status(thm)],[t44,t9]) ).
cnf(t40,plain,
zero = sFlat0,
inference(orient,[status(thm)],[t45]) ).
cnf(f7,negated_conjecture,
divide(a,identity) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_divide_id_is_zero) ).
fof(f7_nnf,plain,
divide(a,identity) != zero,
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
divide(a,identity) != zero,
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
divide(a,identity) != zero,
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(goal_0,negated_conjecture,
divide(a,identity) != zero,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(g0_0,plain,
sFlat0 != zero,
inference(rw,[status(thm)],[goal_0,t28]) ).
cnf(g0_1,plain,
sFlat0 != sFlat0,
inference(rw,[status(thm)],[g0_0,t40]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN001-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 16:07:57 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.50/1.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.50/1.22 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------