↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : HEN008-6 : 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 : n012.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 14.45s 2.34s
% Output   : CNFRefutation 14.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  21 unt;   0 nHn;  15 RR)
%            Number of literals    :   39 (  15 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   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   :   34 (   7 sgn)

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

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(c3,plain,
    'less$uequal'(a,b),
    inference(clausification,[status(esa)],[a_LE_b]) ).

cnf(c4,plain,
    ~ 'less$uequal'(divide(a,c),divide(b,c)),
    inference(clausification,[status(esa)],[prove_a_divide_c_LE_b_divide_c]) ).

cnf(c5,plain,
    ( divide(X0,X1) = zero
    | ~ 'less$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[quotient_less_equal1]) ).

cnf(c6,plain,
    ( 'less$uequal'(X0,X1)
    | divide(X0,X1) != zero ),
    inference(clausification,[status(esa)],[quotient_less_equal2]) ).

cnf(c7,plain,
    'less$uequal'(divide(X0,X1),X0),
    inference(clausification,[status(esa)],[quotient_smaller_than_numerator]) ).

cnf(c8,plain,
    'less$uequal'(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    inference(clausification,[status(esa)],[quotient_property]) ).

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

cnf(c10,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,zero)
    | zero = X0 ),
    inference(resolution,[status(thm)],[c10,c9]) ).

cnf(d1,plain,
    divide(a,b) = zero,
    inference(resolution,[status(thm)],[c5,c3]) ).

cnf(d2,plain,
    'less$uequal'(divide(divide(a,X0),divide(b,X0)),divide(zero,X0)),
    inference(superposition,[status(thm)],[d1,c8]) ).

cnf(d3,plain,
    'less$uequal'(divide(divide(a,X0),divide(b,X0)),zero),
    inference(demodulation,[status(thm)],[d2,c1]) ).

cnf(d4,plain,
    zero = divide(divide(a,X0),divide(b,X0)),
    inference(resolution,[status(thm)],[d3,d0]) ).

cnf(d5,plain,
    ( 'less$uequal'(divide(a,X0),divide(b,X0))
    | zero != zero ),
    inference(superposition,[status(thm)],[d4,c6]) ).

cnf(d6,plain,
    divide(divide(X0,X1),X0) = zero,
    inference(resolution,[status(thm)],[c5,c7]) ).

cnf(d7,plain,
    divide(zero,zero) = zero,
    inference(superposition,[status(thm)],[c1,d6]) ).

cnf(d8,plain,
    zero = zero,
    inference(demodulation,[status(thm)],[d7,c1]) ).

cnf(d9,plain,
    'less$uequal'(divide(a,X0),divide(b,X0)),
    inference(resolution,[status(thm)],[d8,d5]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[d9,c4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : HEN008-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Fri Sep 25 15:57:05 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.45/2.34  % SZS status Unsatisfiable for theBenchmark.p
% 14.45/2.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------