%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : HEN002-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n004.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 5.05s 6.21s
% Output : Proof 5.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 4 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,axiom,
divide(zero,X) = zero,
file('/export/starexec/sandbox2/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(f5,negated_conjecture,
divide(zero,a) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zero_divide_anything_is_zero) ).
fof(f5_nnf,plain,
divide(zero,a) != zero,
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
divide(zero,a) != zero,
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
divide(zero,a) != zero,
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(goal_0,negated_conjecture,
divide(zero,a) != zero,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
zero != zero,
inference(rw,[status(thm)],[goal_0,t30]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN002-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.37 % Computer : n004.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Wed Sep 23 16:09:12 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.05/6.21 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.05/6.21 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------