%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : HEN010-7 : 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 : n013.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:50 AM UTC 2026
% Result : Unsatisfiable 9.24s 11.16s
% Output : CNFRefutation 9.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 20 unt; 0 nHn; 39 RR)
% Number of literals : 104 ( 5 equ; 61 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(x_divide_x_is_zero,axiom,
quotient(X0,X0,zero) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X0,zero,X0) ).
cnf(transitivity_of_less_equal,axiom,
( 'less$uequal'(X0,X2)
| ~ 'less$uequal'(X1,X2)
| ~ 'less$uequal'(X0,X1) ) ).
cnf(xQyLEz_implies_xQzLEy,axiom,
( 'less$uequal'(X4,X1)
| ~ quotient(X0,X3,X4)
| ~ 'less$uequal'(X2,X3)
| ~ quotient(X0,X1,X2) ) ).
cnf(xLEy_implies_zQyLEzQx,axiom,
( 'less$uequal'(X3,X4)
| ~ quotient(X2,X0,X4)
| ~ quotient(X2,X1,X3)
| ~ 'less$uequal'(X0,X1) ) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa) ).
cnf(identity_divide_idQa,hypothesis,
quotient(identity,idQa,'idQ$uidQa') ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(idQa,'idQ$uidQa','idQa$uQ$u$uidQ$uidQa') ).
cnf(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
idQa != 'idQa$uQ$u$uidQ$uidQa' ).
cnf(less_equal_quotient,axiom,
( 'less$uequal'(X0,X1)
| ~ quotient(X0,X1,zero) ) ).
cnf(divisor_existence,axiom,
( 'less$uequal'(X2,X0)
| ~ quotient(X0,X1,X2) ) ).
cnf(quotient_property,axiom,
( 'less$uequal'(X6,X7)
| ~ quotient(X2,X3,X7)
| ~ quotient(X5,X4,X6)
| ~ quotient(X0,X3,X5)
| ~ quotient(X1,X3,X4)
| ~ quotient(X0,X1,X2) ) ).
cnf(less_equal_and_equal,axiom,
( X0 = X1
| ~ 'less$uequal'(X1,X0)
| ~ 'less$uequal'(X0,X1) ) ).
cnf(closure,axiom,
quotient(X0,X1,divide(X0,X1)) ).
cnf(c2,plain,
quotient(X0,X0,zero),
inference(clausification,[status(esa)],[x_divide_x_is_zero]) ).
cnf(c3,plain,
quotient(X0,zero,X0),
inference(clausification,[status(esa)],[x_divde_zero_is_x]) ).
cnf(c4,plain,
( 'less$uequal'(X0,X2)
| ~ 'less$uequal'(X1,X2)
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[transitivity_of_less_equal]) ).
cnf(c5,plain,
( 'less$uequal'(X4,X1)
| ~ quotient(X0,X3,X4)
| ~ 'less$uequal'(X2,X3)
| ~ quotient(X0,X1,X2) ),
inference(clausification,[status(esa)],[xQyLEz_implies_xQzLEy]) ).
cnf(c6,plain,
( 'less$uequal'(X3,X4)
| ~ quotient(X2,X0,X4)
| ~ quotient(X2,X1,X3)
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[xLEy_implies_zQyLEzQx]) ).
cnf(c8,plain,
quotient(identity,a,idQa),
inference(clausification,[status(esa)],[identity_divide_a]) ).
cnf(c9,plain,
quotient(identity,idQa,'idQ$uidQa'),
inference(clausification,[status(esa)],[identity_divide_idQa]) ).
cnf(c10,plain,
quotient(idQa,'idQ$uidQa','idQa$uQ$u$uidQ$uidQa'),
inference(clausification,[status(esa)],[identity_divide_idQ_idQa]) ).
cnf(c11,plain,
idQa != 'idQa$uQ$u$uidQ$uidQa',
inference(clausification,[status(esa)],[prove_idQa_equals_idQa_Q__idQ_idQa]) ).
cnf(c13,plain,
( 'less$uequal'(X0,X1)
| ~ quotient(X0,X1,zero) ),
inference(clausification,[status(esa)],[less_equal_quotient]) ).
cnf(c14,plain,
( 'less$uequal'(X2,X0)
| ~ quotient(X0,X1,X2) ),
inference(clausification,[status(esa)],[divisor_existence]) ).
cnf(c15,plain,
( 'less$uequal'(X2,X7)
| ~ quotient(X5,X4,X0)
| ~ quotient(X6,X4,X7)
| ~ quotient(X5,X3,X6)
| ~ quotient(X3,X4,X1)
| ~ quotient(X0,X1,X2) ),
inference(clausification,[status(esa)],[quotient_property]) ).
cnf(c17,plain,
( X0 = X1
| ~ 'less$uequal'(X1,X0)
| ~ 'less$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[less_equal_and_equal]) ).
cnf(c19,plain,
quotient(X0,X1,divide(X0,X1)),
inference(clausification,[status(esa)],[closure]) ).
cnf(d0,plain,
( ~ 'less$uequal'('idQ$uidQa',X0)
| 'less$uequal'(X1,'idQa$uQ$u$uidQ$uidQa')
| ~ quotient(idQa,X0,X1) ),
inference(resolution,[status(thm)],[c10,c6]) ).
cnf(d1,plain,
( ~ 'less$uequal'('idQ$uidQa',X0)
| 'less$uequal'(divide(idQa,X0),'idQa$uQ$u$uidQ$uidQa') ),
inference(resolution,[status(thm)],[d0,c19]) ).
cnf(d2,plain,
( ~ 'less$uequal'(X1,divide(idQa,X0))
| 'less$uequal'(X1,'idQa$uQ$u$uidQ$uidQa')
| ~ 'less$uequal'('idQ$uidQa',X0) ),
inference(resolution,[status(thm)],[d1,c4]) ).
cnf(d3,plain,
( 'less$uequal'(X4,divide(X6,X1))
| ~ quotient(X5,X1,X3)
| ~ quotient(X5,X0,X6)
| ~ quotient(X3,X2,X4)
| ~ quotient(X0,X1,X2) ),
inference(resolution,[status(thm)],[c15,c19]) ).
cnf(d4,plain,
( 'less$uequal'(X4,divide(X3,X1))
| ~ quotient(X2,zero,X4)
| ~ quotient(X0,X1,X3)
| ~ quotient(X0,X1,X2) ),
inference(resolution,[status(thm)],[d3,c2]) ).
cnf(d5,plain,
( 'less$uequal'(X0,divide(X1,a))
| ~ quotient(identity,a,X1)
| ~ quotient(idQa,zero,X0) ),
inference(resolution,[status(thm)],[d4,c8]) ).
cnf(d6,plain,
( ~ 'less$uequal'('idQ$uidQa',a)
| 'less$uequal'(X0,'idQa$uQ$u$uidQ$uidQa')
| ~ quotient(idQa,zero,X0)
| ~ quotient(identity,a,idQa) ),
inference(resolution,[status(thm)],[d5,d2]) ).
cnf(d7,plain,
( ~ 'less$uequal'('idQ$uidQa',a)
| 'less$uequal'(X0,'idQa$uQ$u$uidQ$uidQa')
| ~ quotient(idQa,zero,X0) ),
inference(resolution,[status(thm)],[c8,d6]) ).
cnf(d8,plain,
( ~ 'less$uequal'(idQa,X0)
| 'less$uequal'(X1,a)
| ~ quotient(identity,X0,X1) ),
inference(resolution,[status(thm)],[c5,c8]) ).
cnf(d9,plain,
( ~ 'less$uequal'(idQa,idQa)
| 'less$uequal'('idQ$uidQa',a) ),
inference(resolution,[status(thm)],[d8,c9]) ).
cnf(d10,plain,
'less$uequal'(X0,X0),
inference(resolution,[status(thm)],[c13,c2]) ).
cnf(d11,plain,
'less$uequal'('idQ$uidQa',a),
inference(resolution,[status(thm)],[d10,d9]) ).
cnf(d12,plain,
( 'less$uequal'(X0,'idQa$uQ$u$uidQ$uidQa')
| ~ quotient(idQa,zero,X0) ),
inference(resolution,[status(thm)],[d11,d7]) ).
cnf(d13,plain,
'less$uequal'(idQa,'idQa$uQ$u$uidQ$uidQa'),
inference(resolution,[status(thm)],[d12,c3]) ).
cnf(d14,plain,
'less$uequal'('idQa$uQ$u$uidQ$uidQa',idQa),
inference(resolution,[status(thm)],[c14,c10]) ).
cnf(d15,plain,
( ~ 'less$uequal'(idQa,'idQa$uQ$u$uidQ$uidQa')
| idQa = 'idQa$uQ$u$uidQ$uidQa' ),
inference(resolution,[status(thm)],[d14,c17]) ).
cnf(d16,plain,
~ 'less$uequal'(idQa,'idQa$uQ$u$uidQ$uidQa'),
inference(resolution,[status(thm)],[c11,d15]) ).
cnf(d17,plain,
$false,
inference(resolution,[status(thm)],[d16,d13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN010-7 : 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.10/6.81 % Computer : n013.cluster.edu
% 0.10/6.81 % Model : x86_64 x86_64
% 0.10/6.81 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/6.81 % Memory : 8046.5625MB
% 0.10/6.81 % OS : Linux 6.8.0-71-generic
% 0.10/6.81 % CPULimit : 300
% 0.10/6.81 % WCLimit : 300
% 0.10/6.81 % DateTime : Fri Sep 25 15:57:54 UTC 2026
% 0.10/6.81 % CPUTime :
% 0.10/6.81 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.24/11.16 % SZS status Unsatisfiable for theBenchmark.p
% 9.24/11.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------