%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : HEN005-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 : Sun Sep 27 07:31:45 AM UTC 2026
% Result : Unsatisfiable 12.79s 2.08s
% Output : CNFRefutation 12.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 28 unt; 0 nHn; 23 RR)
% Number of literals : 46 ( 19 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X0) = zero ).
cnf(x_divide_zero_is_x,axiom,
divide(X0,zero) = X0 ).
cnf(a_LE_b,hypothesis,
'less$uequal'(a,b) ).
cnf(b_LE_c,hypothesis,
'less$uequal'(b,c) ).
cnf(prove_a_LE_c,negated_conjecture,
~ 'less$uequal'(a,c) ).
cnf(quotient_less_equal1,axiom,
( divide(X0,X1) = zero
| ~ 'less$uequal'(X0,X1) ) ).
cnf(quotient_less_equal2,axiom,
( 'less$uequal'(X0,X1)
| divide(X0,X1) != zero ) ).
cnf(quotient_smaller_than_numerator,axiom,
'less$uequal'(divide(X0,X1),X0) ).
cnf(quotient_property,axiom,
'less$uequal'(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) ).
cnf(zero_is_smallest,axiom,
'less$uequal'(zero,X0) ).
cnf(less_equal_and_equal,axiom,
( X0 = X1
| ~ 'less$uequal'(X1,X0)
| ~ 'less$uequal'(X0,X1) ) ).
cnf(c1,plain,
divide(zero,X0) = zero,
inference(clausification,[status(esa)],[zero_divide_anything_is_zero]) ).
cnf(c3,plain,
divide(X0,zero) = X0,
inference(clausification,[status(esa)],[x_divide_zero_is_x]) ).
cnf(c4,plain,
'less$uequal'(a,b),
inference(clausification,[status(esa)],[a_LE_b]) ).
cnf(c5,plain,
'less$uequal'(b,c),
inference(clausification,[status(esa)],[b_LE_c]) ).
cnf(c6,plain,
~ 'less$uequal'(a,c),
inference(clausification,[status(esa)],[prove_a_LE_c]) ).
cnf(c7,plain,
( divide(X0,X1) = zero
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[quotient_less_equal1]) ).
cnf(c8,plain,
( 'less$uequal'(X0,X1)
| divide(X0,X1) != zero ),
inference(clausification,[status(esa)],[quotient_less_equal2]) ).
cnf(c9,plain,
'less$uequal'(divide(X0,X1),X0),
inference(clausification,[status(esa)],[quotient_smaller_than_numerator]) ).
cnf(c10,plain,
'less$uequal'(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(clausification,[status(esa)],[quotient_property]) ).
cnf(c11,plain,
'less$uequal'(zero,X0),
inference(clausification,[status(esa)],[zero_is_smallest]) ).
cnf(c12,plain,
( X0 = X1
| ~ 'less$uequal'(X1,X0)
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[less_equal_and_equal]) ).
cnf(d0,plain,
( ~ 'less$uequal'(X0,zero)
| X0 = zero ),
inference(resolution,[status(thm)],[c12,c11]) ).
cnf(d1,plain,
divide(b,c) = zero,
inference(resolution,[status(thm)],[c7,c5]) ).
cnf(d2,plain,
'less$uequal'(divide(divide(X0,c),zero),divide(divide(X0,b),c)),
inference(superposition,[status(thm)],[d1,c10]) ).
cnf(d3,plain,
'less$uequal'(divide(X0,c),divide(divide(X0,b),c)),
inference(demodulation,[status(thm)],[d2,c3]) ).
cnf(d4,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c7,c4]) ).
cnf(d5,plain,
'less$uequal'(divide(a,c),divide(zero,c)),
inference(superposition,[status(thm)],[d4,d3]) ).
cnf(d6,plain,
'less$uequal'(divide(a,c),zero),
inference(demodulation,[status(thm)],[d5,c1]) ).
cnf(d7,plain,
divide(a,c) = zero,
inference(resolution,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
( 'less$uequal'(a,c)
| zero != zero ),
inference(superposition,[status(thm)],[d7,c8]) ).
cnf(d9,plain,
zero != zero,
inference(resolution,[status(thm)],[c6,d8]) ).
cnf(d10,plain,
divide(divide(X0,X1),X0) = zero,
inference(resolution,[status(thm)],[c9,c7]) ).
cnf(d11,plain,
divide(zero,b) = zero,
inference(superposition,[status(thm)],[d1,d10]) ).
cnf(d12,plain,
zero = zero,
inference(demodulation,[status(thm)],[d11,c1]) ).
cnf(d13,plain,
$false,
inference(resolution,[status(thm)],[d12,d9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 15:58:07 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.79/2.08 % SZS status Unsatisfiable for theBenchmark.p
% 12.79/2.08 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------