↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : HEN006-2 : 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 : n006.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:46 AM UTC 2026

% Result   : Unsatisfiable 35.90s 4.97s
% Output   : CNFRefutation 35.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   46 (  27 unt;   0 nHn;  36 RR)
%            Number of literals    :   87 (   5 equ;  43 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   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   :   79 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(zero_divide_anything_is_zero,axiom,
    quotient(zero,X0,zero) ).

cnf(x_divde_zero_is_x,axiom,
    quotient(X0,zero,X0) ).

cnf(xQy,hypothesis,
    quotient(x,y,xQy) ).

cnf(xQyLEz,hypothesis,
    'less$uequal'(xQy,z) ).

cnf(xQz,hypothesis,
    quotient(x,z,xQz) ).

cnf(prove_xQzLEy,negated_conjecture,
    ~ 'less$uequal'(xQz,y) ).

cnf(quotient_less_equal,axiom,
    ( quotient(X0,X1,zero)
    | ~ 'less$uequal'(X0,X1) ) ).

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(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(closure,axiom,
    quotient(X0,X1,divide(X0,X1)) ).

cnf(c1,plain,
    quotient(zero,X0,zero),
    inference(clausification,[status(esa)],[zero_divide_anything_is_zero]) ).

cnf(c3,plain,
    quotient(X0,zero,X0),
    inference(clausification,[status(esa)],[x_divde_zero_is_x]) ).

cnf(c5,plain,
    quotient(x,y,xQy),
    inference(clausification,[status(esa)],[xQy]) ).

cnf(c6,plain,
    'less$uequal'(xQy,z),
    inference(clausification,[status(esa)],[xQyLEz]) ).

cnf(c7,plain,
    quotient(x,z,xQz),
    inference(clausification,[status(esa)],[xQz]) ).

cnf(c8,plain,
    ~ 'less$uequal'(xQz,y),
    inference(clausification,[status(esa)],[prove_xQzLEy]) ).

cnf(c9,plain,
    ( quotient(X0,X1,zero)
    | ~ 'less$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[quotient_less_equal]) ).

cnf(c10,plain,
    ( 'less$uequal'(X0,X1)
    | ~ quotient(X0,X1,zero) ),
    inference(clausification,[status(esa)],[less_equal_quotient]) ).

cnf(c11,plain,
    ( 'less$uequal'(X2,X0)
    | ~ quotient(X0,X1,X2) ),
    inference(clausification,[status(esa)],[divisor_existence]) ).

cnf(c12,plain,
    ( ~ quotient(X7,X1,X4)
    | ~ quotient(X6,X1,X5)
    | ~ quotient(X0,X6,X7)
    | ~ quotient(X2,X5,X3)
    | 'less$uequal'(X3,X4)
    | ~ quotient(X0,X1,X2) ),
    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(c16,plain,
    quotient(X0,X1,divide(X0,X1)),
    inference(clausification,[status(esa)],[closure]) ).

cnf(d0,plain,
    ( ~ 'less$uequal'(X0,zero)
    | X0 = zero ),
    inference(resolution,[status(thm)],[c14,c13]) ).

cnf(d1,plain,
    ( 'less$uequal'(X5,zero)
    | ~ quotient(X4,X2,X5)
    | ~ quotient(X3,X0,zero)
    | ~ quotient(X3,X1,X4)
    | ~ quotient(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c12,c1]) ).

cnf(d2,plain,
    ( 'less$uequal'(X2,zero)
    | ~ quotient(X3,X1,zero)
    | ~ quotient(X0,X3,zero)
    | ~ quotient(X0,X1,X2) ),
    inference(resolution,[status(thm)],[d1,c3]) ).

cnf(d3,plain,
    'less$uequal'(divide(X0,X1),X0),
    inference(resolution,[status(thm)],[c16,c11]) ).

cnf(d4,plain,
    quotient(divide(X0,X1),X0,zero),
    inference(resolution,[status(thm)],[d3,c9]) ).

cnf(d5,plain,
    ( 'less$uequal'(X3,zero)
    | ~ quotient(X0,X1,X3)
    | ~ quotient(X0,divide(X1,X2),zero) ),
    inference(resolution,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    ( 'less$uequal'(divide(X0,X1),zero)
    | ~ quotient(X0,divide(X1,X2),zero) ),
    inference(resolution,[status(thm)],[d5,c16]) ).

cnf(d7,plain,
    quotient(xQy,z,zero),
    inference(resolution,[status(thm)],[c9,c6]) ).

cnf(d8,plain,
    ( 'less$uequal'(X4,zero)
    | ~ quotient(X3,X1,X4)
    | ~ quotient(X2,X0,xQy)
    | ~ quotient(X2,z,X3)
    | ~ quotient(X0,z,X1) ),
    inference(resolution,[status(thm)],[d7,c12]) ).

cnf(d9,plain,
    ( 'less$uequal'(divide(X2,X3),zero)
    | ~ quotient(X1,z,X3)
    | ~ quotient(X0,z,X2)
    | ~ quotient(X0,X1,xQy) ),
    inference(resolution,[status(thm)],[d8,c16]) ).

cnf(d10,plain,
    ( 'less$uequal'(divide(X2,divide(X1,z)),zero)
    | ~ quotient(X0,z,X2)
    | ~ quotient(X0,X1,xQy) ),
    inference(resolution,[status(thm)],[d9,c16]) ).

cnf(d11,plain,
    ( 'less$uequal'(divide(X0,divide(y,z)),zero)
    | ~ quotient(x,z,X0) ),
    inference(resolution,[status(thm)],[d10,c5]) ).

cnf(d12,plain,
    'less$uequal'(divide(xQz,divide(y,z)),zero),
    inference(resolution,[status(thm)],[d11,c7]) ).

cnf(d13,plain,
    divide(xQz,divide(y,z)) = zero,
    inference(resolution,[status(thm)],[d12,d0]) ).

cnf(d14,plain,
    quotient(xQz,divide(y,z),zero),
    inference(superposition,[status(thm)],[d13,c16]) ).

cnf(d15,plain,
    'less$uequal'(divide(xQz,y),zero),
    inference(resolution,[status(thm)],[d14,d6]) ).

cnf(d16,plain,
    divide(xQz,y) = zero,
    inference(resolution,[status(thm)],[d15,d0]) ).

cnf(d17,plain,
    quotient(xQz,y,zero),
    inference(superposition,[status(thm)],[d16,c16]) ).

cnf(d18,plain,
    'less$uequal'(xQz,y),
    inference(resolution,[status(thm)],[d17,c10]) ).

cnf(d19,plain,
    $false,
    inference(resolution,[status(thm)],[c8,d18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HEN006-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep 25 15:56:26 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.90/4.97  % SZS status Unsatisfiable for theBenchmark.p
% 35.90/4.97  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------