%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : HEN008-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:48 AM UTC 2026
% Result : Unsatisfiable 26.53s 3.65s
% Output : CNFRefutation 26.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 28 unt; 0 nHn; 18 RR)
% Number of literals : 54 ( 20 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 53 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X0) = zero ).
cnf(x_divide_x_is_zero,axiom,
divide(X0,X0) = zero ).
cnf(property_of_divide1,axiom,
( 'less$uequal'(divide(X0,X2),X1)
| ~ 'less$uequal'(divide(X0,X1),X2) ) ).
cnf(a_LE_b,hypothesis,
'less$uequal'(a,b) ).
cnf(prove_a_divide_c_LE_b_divide_c,negated_conjecture,
~ 'less$uequal'(divide(a,c),divide(b,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(c2,plain,
divide(X0,X0) = zero,
inference(clausification,[status(esa)],[x_divide_x_is_zero]) ).
cnf(c5,plain,
( 'less$uequal'(divide(X0,X2),X1)
| ~ 'less$uequal'(divide(X0,X1),X2) ),
inference(clausification,[status(esa)],[property_of_divide1]) ).
cnf(c7,plain,
'less$uequal'(a,b),
inference(clausification,[status(esa)],[a_LE_b]) ).
cnf(c8,plain,
~ 'less$uequal'(divide(a,c),divide(b,c)),
inference(clausification,[status(esa)],[prove_a_divide_c_LE_b_divide_c]) ).
cnf(c9,plain,
( divide(X0,X1) = zero
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[quotient_less_equal1]) ).
cnf(c10,plain,
( 'less$uequal'(X0,X1)
| divide(X0,X1) != zero ),
inference(clausification,[status(esa)],[quotient_less_equal2]) ).
cnf(c11,plain,
'less$uequal'(divide(X0,X1),X0),
inference(clausification,[status(esa)],[quotient_smaller_than_numerator]) ).
cnf(c12,plain,
'less$uequal'(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(clausification,[status(esa)],[quotient_property]) ).
cnf(c13,plain,
'less$uequal'(zero,X0),
inference(clausification,[status(esa)],[zero_is_smallest]) ).
cnf(c14,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,divide(X0,X1))
| divide(X0,X1) = X0 ),
inference(resolution,[status(thm)],[c14,c11]) ).
cnf(d1,plain,
( ~ 'less$uequal'(X0,zero)
| zero = X0 ),
inference(resolution,[status(thm)],[c14,c13]) ).
cnf(d2,plain,
( 'less$uequal'(X0,X0)
| zero != zero ),
inference(superposition,[status(thm)],[c2,c10]) ).
cnf(d3,plain,
'less$uequal'(X0,X0),
inference(equality_resolution,[status(thm)],[d2]) ).
cnf(d4,plain,
'less$uequal'(divide(X0,divide(X0,X1)),X1),
inference(resolution,[status(thm)],[d3,c5]) ).
cnf(d5,plain,
zero = divide(X0,divide(X0,zero)),
inference(resolution,[status(thm)],[d4,d1]) ).
cnf(d6,plain,
( 'less$uequal'(X0,divide(X0,zero))
| zero != zero ),
inference(superposition,[status(thm)],[d5,c10]) ).
cnf(d7,plain,
divide(divide(X0,X1),X0) = zero,
inference(resolution,[status(thm)],[c9,c11]) ).
cnf(d8,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c9,c7]) ).
cnf(d9,plain,
divide(zero,a) = zero,
inference(superposition,[status(thm)],[d8,d7]) ).
cnf(d10,plain,
zero = zero,
inference(demodulation,[status(thm)],[d9,c1]) ).
cnf(d11,plain,
'less$uequal'(X0,divide(X0,zero)),
inference(resolution,[status(thm)],[d10,d6]) ).
cnf(d12,plain,
divide(X0,zero) = X0,
inference(resolution,[status(thm)],[d11,d0]) ).
cnf(d13,plain,
'less$uequal'(divide(divide(X0,X1),divide(divide(X0,X2),X1)),divide(X2,X1)),
inference(resolution,[status(thm)],[c12,c5]) ).
cnf(d14,plain,
'less$uequal'(divide(divide(a,X0),divide(zero,X0)),divide(b,X0)),
inference(superposition,[status(thm)],[d8,d13]) ).
cnf(d15,plain,
'less$uequal'(divide(divide(a,X0),zero),divide(b,X0)),
inference(demodulation,[status(thm)],[d14,c1]) ).
cnf(d16,plain,
'less$uequal'(divide(a,X0),divide(b,X0)),
inference(demodulation,[status(thm)],[d15,d12]) ).
cnf(d17,plain,
$false,
inference(resolution,[status(thm)],[d16,c8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN008-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.36 % Computer : n020.cluster.edu
% 0.03/0.36 % Model : x86_64 x86_64
% 0.03/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.36 % Memory : 8046.5625MB
% 0.03/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Fri Sep 25 15:58:04 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.53/3.65 % SZS status Unsatisfiable for theBenchmark.p
% 26.53/3.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------