↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n014.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:45:00 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    e(exist) ).

cnf(clause_2,axiom,
    ( ~ c(X0)
    | s2least(X0) ) ).

cnf(clause_4,axiom,
    ( ~ equalish(u1r2(X0),u1r1(X0))
    | ~ s2least(X0) ) ).

cnf(clause_5,axiom,
    ( ~ s2least(X0)
    | s(X0,u1r1(X0)) ) ).

cnf(clause_6,axiom,
    ( ~ s2least(X0)
    | s(X0,u1r2(X0)) ) ).

cnf(clause_8,axiom,
    ( ~ d(X0)
    | s1most(X0) ) ).

cnf(clause_10,axiom,
    ( ~ s(X2,X1)
    | ~ s(X2,X0)
    | ~ s1most(X2)
    | equalish(X0,X1) ) ).

cnf(clause_14,axiom,
    ( ~ e(X0)
    | r(X0,u4r2(X0)) ) ).

cnf(clause_15,axiom,
    ( ~ r(X1,X0)
    | ~ e(X1)
    | d(X0) ) ).

cnf(clause_16,axiom,
    ( ~ r(X1,X0)
    | ~ e(X1)
    | c(X0) ) ).

cnf(c0,plain,
    e(exist),
    inference(clausification,[status(esa)],[clause_1]) ).

cnf(c1,plain,
    ( ~ c(X0)
    | s2least(X0) ),
    inference(clausification,[status(esa)],[clause_2]) ).

cnf(c3,plain,
    ( ~ equalish(u1r2(X0),u1r1(X0))
    | ~ s2least(X0) ),
    inference(clausification,[status(esa)],[clause_4]) ).

cnf(c4,plain,
    ( ~ s2least(X0)
    | s(X0,u1r1(X0)) ),
    inference(clausification,[status(esa)],[clause_5]) ).

cnf(c5,plain,
    ( ~ s2least(X0)
    | s(X0,u1r2(X0)) ),
    inference(clausification,[status(esa)],[clause_6]) ).

cnf(c7,plain,
    ( ~ d(X0)
    | s1most(X0) ),
    inference(clausification,[status(esa)],[clause_8]) ).

cnf(c9,plain,
    ( ~ s(X2,X1)
    | ~ s(X2,X0)
    | ~ s1most(X2)
    | equalish(X0,X1) ),
    inference(clausification,[status(esa)],[clause_10]) ).

cnf(c13,plain,
    ( ~ e(X0)
    | r(X0,u4r2(X0)) ),
    inference(clausification,[status(esa)],[clause_14]) ).

cnf(c14,plain,
    ( ~ r(X1,X0)
    | ~ e(X1)
    | d(X0) ),
    inference(clausification,[status(esa)],[clause_15]) ).

cnf(c15,plain,
    ( ~ r(X1,X0)
    | ~ e(X1)
    | c(X0) ),
    inference(clausification,[status(esa)],[clause_16]) ).

cnf(d0,plain,
    ( ~ e(X0)
    | c(u4r2(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[c15,c13]) ).

cnf(d1,plain,
    ( s2least(u4r2(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d0,c1]) ).

cnf(d2,plain,
    ( ~ e(X0)
    | d(u4r2(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[c14,c13]) ).

cnf(d3,plain,
    ( s1most(u4r2(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d2,c7]) ).

cnf(d4,plain,
    ( ~ s2least(X0)
    | ~ s1most(X0)
    | ~ s(X0,X1)
    | equalish(u1r2(X0),X1) ),
    inference(resolution,[status(thm)],[c9,c5]) ).

cnf(d5,plain,
    ( ~ s2least(X0)
    | ~ s1most(X0)
    | ~ s(X0,u1r1(X0))
    | ~ s2least(X0) ),
    inference(resolution,[status(thm)],[d4,c3]) ).

cnf(d6,plain,
    ( ~ s2least(X0)
    | ~ s1most(X0)
    | ~ s2least(X0) ),
    inference(resolution,[status(thm)],[d5,c4]) ).

cnf(d7,plain,
    ( ~ e(X0)
    | ~ s2least(u4r2(X0)) ),
    inference(resolution,[status(thm)],[d6,d3]) ).

cnf(d8,plain,
    ( ~ e(X0)
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d7,d1]) ).

cnf(d9,plain,
    $false,
    inference(resolution,[status(thm)],[d8,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS002-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Fri Sep 25 19:31:33 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.34/2.97  % SZS status Unsatisfiable for theBenchmark.p
% 10.34/2.97  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------