↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : FLD056-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n003.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:10:56 AM UTC 2026

% Result   : Unsatisfiable 10.83s 3.32s
% Output   : CNFRefutation 10.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   6 unt;   2 nHn;   9 RR)
%            Number of literals    :   17 (   0 equ;   8 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
    defined(a) ).

cnf(not_less_or_equal_2,negated_conjecture,
    ~ 'less$uor$uequal'(a,a) ).

cnf(totality_of_order_relation,axiom,
    ( ~ defined(X1)
    | ~ defined(X0)
    | 'less$uor$uequal'(X1,X0)
    | 'less$uor$uequal'(X0,X1) ) ).

cnf(c0,plain,
    defined(a),
    inference(clausification,[status(esa)],[a_is_defined]) ).

cnf(c1,plain,
    ~ 'less$uor$uequal'(a,a),
    inference(clausification,[status(esa)],[not_less_or_equal_2]) ).

cnf(c24,plain,
    ( ~ defined(X1)
    | ~ defined(X0)
    | 'less$uor$uequal'(X1,X0)
    | 'less$uor$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[totality_of_order_relation]) ).

cnf(d0,plain,
    ( 'less$uor$uequal'(a,a)
    | ~ defined(a)
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[c24,c1]) ).

cnf(d1,plain,
    'less$uor$uequal'(a,a),
    inference(resolution,[status(thm)],[c0,d0]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[c1,d1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : FLD056-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44  % Computer : n003.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Sun Sep 27 02:33:39 UTC 2026
% 0.17/0.45  % CPUTime  : 
% 0.17/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.83/3.32  % SZS status Unsatisfiable for theBenchmark.p
% 10.83/3.32  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------