↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 17.58s 7.82s
% Output   : CNFRefutation 17.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   29 (  20 unt;   0 nHn;  12 RR)
%            Number of literals    :   40 (  16 equ;  13 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   38 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_a_LE_a,negated_conjecture,
    ~ 'less$uequal'(a,a) ).

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

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

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

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

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

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

cnf(c6,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)],[c6,c5]) ).

cnf(d1,plain,
    divide(divide(X0,X1),X0) = zero,
    inference(resolution,[status(thm)],[c3,c1]) ).

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

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

cnf(d4,plain,
    'less$uequal'(divide(divide(X0,X0),zero),zero),
    inference(superposition,[status(thm)],[d3,d2]) ).

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

cnf(d6,plain,
    ( 'less$uequal'(divide(X0,X0),zero)
    | zero != zero ),
    inference(superposition,[status(thm)],[d5,c2]) ).

cnf(d7,plain,
    divide(zero,X0) = zero,
    inference(resolution,[status(thm)],[c5,c1]) ).

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

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

cnf(d10,plain,
    'less$uequal'(divide(X0,X0),zero),
    inference(resolution,[status(thm)],[d9,d6]) ).

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

cnf(d12,plain,
    ( 'less$uequal'(X0,X0)
    | zero != zero ),
    inference(superposition,[status(thm)],[d11,c2]) ).

cnf(d13,plain,
    'less$uequal'(X0,X0),
    inference(resolution,[status(thm)],[d9,d12]) ).

cnf(d14,plain,
    $false,
    inference(resolution,[status(thm)],[d13,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN012-3 : 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.09/5.36  % Computer : n001.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Fri Sep 25 16:04:31 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.58/7.82  % SZS status Unsatisfiable for theBenchmark.p
% 17.58/7.82  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------