↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n001.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.84s 2.07s
% Output   : CNFRefutation 12.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   44 (  23 unt;   0 nHn;  37 RR)
%            Number of literals    :   85 (  14 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   83 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(xLEy,hypothesis,
    'less$uequal'(x,y) ).

cnf(yLEz,hypothesis,
    'less$uequal'(y,z) ).

cnf(prove_transitivity_of_less_equal,negated_conjecture,
    ~ 'less$uequal'(x,z) ).

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(well_defined,axiom,
    ( X2 = X3
    | ~ quotient(X0,X1,X3)
    | ~ quotient(X0,X1,X2) ) ).

cnf(c0,plain,
    'less$uequal'(x,y),
    inference(clausification,[status(esa)],[xLEy]) ).

cnf(c1,plain,
    'less$uequal'(y,z),
    inference(clausification,[status(esa)],[yLEz]) ).

cnf(c2,plain,
    ~ 'less$uequal'(x,z),
    inference(clausification,[status(esa)],[prove_transitivity_of_less_equal]) ).

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

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

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

cnf(c6,plain,
    ( ~ quotient(X7,X5,X3)
    | ~ quotient(X6,X5,X2)
    | ~ quotient(X6,X7,X4)
    | ~ quotient(X4,X5,X1)
    | ~ quotient(X2,X3,X0)
    | 'less$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[quotient_property]) ).

cnf(c7,plain,
    'less$uequal'(zero,X0),
    inference(clausification,[status(esa)],[zero_is_smallest]) ).

cnf(c8,plain,
    ( X0 = X1
    | ~ 'less$uequal'(X1,X0)
    | ~ 'less$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[less_equal_and_equal]) ).

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

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

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

cnf(d1,plain,
    ( ~ quotient(X1,X2,X0)
    | X0 = divide(X1,X2) ),
    inference(resolution,[status(thm)],[c11,c10]) ).

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

cnf(d3,plain,
    zero = divide(y,z),
    inference(resolution,[status(thm)],[d2,c1]) ).

cnf(d4,plain,
    quotient(y,z,zero),
    inference(superposition,[status(thm)],[d3,c10]) ).

cnf(d5,plain,
    ( ~ quotient(X6,X2,X5)
    | ~ quotient(divide(X6,X3),X4,X0)
    | ~ quotient(X5,X3,X1)
    | ~ quotient(X2,X3,X4)
    | 'less$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[c6,c10]) ).

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

cnf(d7,plain,
    ( ~ quotient(X4,X1,X2)
    | ~ quotient(divide(X0,X4),X1,X3)
    | 'less$uequal'(divide(divide(X0,X1),X2),X3) ),
    inference(resolution,[status(thm)],[d6,c10]) ).

cnf(d8,plain,
    zero = divide(x,y),
    inference(resolution,[status(thm)],[d2,c0]) ).

cnf(d9,plain,
    ( ~ quotient(y,X0,X2)
    | 'less$uequal'(divide(divide(x,X0),X2),X1)
    | ~ quotient(zero,X0,X1) ),
    inference(superposition,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    ( divide(divide(x,X0),X1) = zero
    | ~ quotient(zero,X0,zero)
    | ~ quotient(y,X0,X1) ),
    inference(resolution,[status(thm)],[d9,d0]) ).

cnf(d11,plain,
    'less$uequal'(divide(X0,X1),X0),
    inference(resolution,[status(thm)],[c10,c5]) ).

cnf(d12,plain,
    divide(zero,X0) = zero,
    inference(resolution,[status(thm)],[d0,d11]) ).

cnf(d13,plain,
    quotient(zero,X0,zero),
    inference(superposition,[status(thm)],[d12,c10]) ).

cnf(d14,plain,
    ( ~ quotient(y,X0,X1)
    | divide(divide(x,X0),X1) = zero ),
    inference(resolution,[status(thm)],[d13,d10]) ).

cnf(d15,plain,
    divide(divide(x,z),zero) = zero,
    inference(resolution,[status(thm)],[d14,d4]) ).

cnf(d16,plain,
    quotient(divide(x,z),zero,zero),
    inference(superposition,[status(thm)],[d15,c10]) ).

cnf(d17,plain,
    'less$uequal'(divide(x,z),zero),
    inference(resolution,[status(thm)],[d16,c4]) ).

cnf(d18,plain,
    divide(x,z) = zero,
    inference(resolution,[status(thm)],[d17,d0]) ).

cnf(d19,plain,
    quotient(x,z,zero),
    inference(superposition,[status(thm)],[d18,c10]) ).

cnf(d20,plain,
    'less$uequal'(x,z),
    inference(resolution,[status(thm)],[d19,c4]) ).

cnf(d21,plain,
    $false,
    inference(resolution,[status(thm)],[c2,d20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n001.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Fri Sep 25 16:01:55 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.84/2.07  % SZS status Unsatisfiable for theBenchmark.p
% 12.84/2.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------