↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n008.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 09:01:13 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_2,negated_conjecture,
    'less$uthan'(k,j) ).

cnf(clause_3,negated_conjecture,
    ~ 'less$uthan'(k,i) ).

cnf(clause_9,negated_conjecture,
    'less$uthan'(j,i) ).

cnf(transitivity_of_less_than,axiom,
    ( ~ 'less$uthan'(X2,X1)
    | ~ 'less$uthan'(X0,X2)
    | 'less$uthan'(X0,X1) ) ).

cnf(c1,plain,
    'less$uthan'(k,j),
    inference(clausification,[status(esa)],[clause_2]) ).

cnf(c2,plain,
    ~ 'less$uthan'(k,i),
    inference(clausification,[status(esa)],[clause_3]) ).

cnf(c8,plain,
    'less$uthan'(j,i),
    inference(clausification,[status(esa)],[clause_9]) ).

cnf(c15,plain,
    ( ~ 'less$uthan'(X2,X1)
    | ~ 'less$uthan'(X0,X2)
    | 'less$uthan'(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_of_less_than]) ).

cnf(d0,plain,
    ( 'less$uthan'(k,X0)
    | ~ 'less$uthan'(j,X0) ),
    inference(resolution,[status(thm)],[c15,c1]) ).

cnf(d1,plain,
    'less$uthan'(k,i),
    inference(resolution,[status(thm)],[d0,c8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.57  % Computer : n008.cluster.edu
% 0.09/5.57  % Model    : x86_64 x86_64
% 0.09/5.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.57  % Memory   : 8046.5625MB
% 0.09/5.57  % OS       : Linux 6.8.0-71-generic
% 0.09/5.57  % CPULimit : 300
% 0.09/5.57  % WCLimit  : 300
% 0.09/5.57  % DateTime : Sat Sep 26 13:05:31 UTC 2026
% 0.09/5.57  % CPUTime  : 
% 0.09/5.57  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.44/7.39  % SZS status Unsatisfiable for theBenchmark.p
% 12.44/7.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------