↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 14.65s 2.56s
% Output   : CNFRefutation 14.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   32 (  19 unt;   0 nHn;  26 RR)
%            Number of literals    :   54 (   4 equ;  24 neg)
%            Maximal clause size   :    4 (   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   :   47 (   0 sgn)

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

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,hypothesis,
    'less$uequal'(x,y) ).

cnf(zQy,hypothesis,
    quotient(z,y,zQy) ).

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

cnf(prove_zQyLEzQx,negated_conjecture,
    ~ 'less$uequal'(zQy,zQx) ).

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

cnf(closure,axiom,
    quotient(X0,X1,divide(X0,X1)) ).

cnf(well_defined,axiom,
    ( X2 = X3
    | ~ quotient(X0,X1,X3)
    | ~ quotient(X0,X1,X2) ) ).

cnf(c2,plain,
    quotient(X0,X0,zero),
    inference(clausification,[status(esa)],[x_divide_x_is_zero]) ).

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'(x,y),
    inference(clausification,[status(esa)],[xLEy]) ).

cnf(c7,plain,
    quotient(z,y,zQy),
    inference(clausification,[status(esa)],[zQy]) ).

cnf(c8,plain,
    quotient(z,x,zQx),
    inference(clausification,[status(esa)],[zQx]) ).

cnf(c9,plain,
    ~ 'less$uequal'(zQy,zQx),
    inference(clausification,[status(esa)],[prove_zQyLEzQx]) ).

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

cnf(c17,plain,
    quotient(X0,X1,divide(X0,X1)),
    inference(clausification,[status(esa)],[closure]) ).

cnf(c18,plain,
    ( X2 = X3
    | ~ quotient(X0,X1,X3)
    | ~ quotient(X0,X1,X2) ),
    inference(clausification,[status(esa)],[well_defined]) ).

cnf(d0,plain,
    ( ~ 'less$uequal'(divide(X0,X3),X1)
    | 'less$uequal'(X2,X3)
    | ~ quotient(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c17,c5]) ).

cnf(d1,plain,
    ( ~ 'less$uequal'(X0,x)
    | 'less$uequal'(X0,y) ),
    inference(resolution,[status(thm)],[c4,c6]) ).

cnf(d2,plain,
    'less$uequal'(X0,X0),
    inference(resolution,[status(thm)],[c11,c2]) ).

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

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

cnf(d5,plain,
    ( ~ quotient(z,x,X0)
    | X0 = zQx ),
    inference(resolution,[status(thm)],[c18,c8]) ).

cnf(d6,plain,
    divide(z,x) = zQx,
    inference(resolution,[status(thm)],[d5,c17]) ).

cnf(d7,plain,
    'less$uequal'(divide(z,zQx),x),
    inference(superposition,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    'less$uequal'(divide(z,zQx),y),
    inference(resolution,[status(thm)],[d7,d1]) ).

cnf(d9,plain,
    ( 'less$uequal'(X0,zQx)
    | ~ quotient(z,y,X0) ),
    inference(resolution,[status(thm)],[d8,d0]) ).

cnf(d10,plain,
    'less$uequal'(zQy,zQx),
    inference(resolution,[status(thm)],[d9,c7]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[c9,d10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN007-2 : 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.08/0.35  % Computer : n020.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.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 15:57:48 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.65/2.56  % SZS status Unsatisfiable for theBenchmark.p
% 14.65/2.56  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------