↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 10.35s 1.99s
% Output   : CNFRefutation 10.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   48 (   6 unt;  18 nHn;  40 RR)
%            Number of literals    :  124 (   0 equ;  60 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   56 (   0 sgn)

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

cnf(clause_2,negated_conjecture,
    ~ f(exist) ).

cnf(clause_3,axiom,
    ( ~ c(X0)
    | t2least(X0) ) ).

cnf(clause_5,axiom,
    ( ~ equalish(u1r2(X0),u1r1(X0))
    | ~ t2least(X0) ) ).

cnf(clause_6,axiom,
    ( ~ t2least(X0)
    | t(X0,u1r1(X0)) ) ).

cnf(clause_7,axiom,
    ( ~ t2least(X0)
    | t(X0,u1r2(X0)) ) ).

cnf(clause_9,axiom,
    ( ~ d(X0)
    | t1most(X0) ) ).

cnf(clause_11,axiom,
    ( ~ t(X2,X1)
    | ~ t(X2,X0)
    | ~ t1most(X2)
    | equalish(X0,X1) ) ).

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

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

cnf(clause_26,axiom,
    ( ~ s(X0,X2)
    | ~ s(X0,X1)
    | equalish(X1,X2)
    | s2least(X0) ) ).

cnf(clause_28,axiom,
    ( ~ s1most(u6r1(X0))
    | f(X0) ) ).

cnf(clause_29,axiom,
    ( r(X0,u6r1(X0))
    | f(X0) ) ).

cnf(clause_31,axiom,
    ( ~ equalish(u7r2(X0),u7r1(X0))
    | s1most(X0) ) ).

cnf(clause_32,axiom,
    ( s(X0,u7r1(X0))
    | s1most(X0) ) ).

cnf(clause_33,axiom,
    ( s(X0,u7r2(X0))
    | s1most(X0) ) ).

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

cnf(c1,plain,
    ~ f(exist),
    inference(clausification,[status(esa)],[clause_2]) ).

cnf(c2,plain,
    ( ~ c(X0)
    | t2least(X0) ),
    inference(clausification,[status(esa)],[clause_3]) ).

cnf(c4,plain,
    ( ~ equalish(u1r2(X0),u1r1(X0))
    | ~ t2least(X0) ),
    inference(clausification,[status(esa)],[clause_5]) ).

cnf(c5,plain,
    ( ~ t2least(X0)
    | t(X0,u1r1(X0)) ),
    inference(clausification,[status(esa)],[clause_6]) ).

cnf(c6,plain,
    ( ~ t2least(X0)
    | t(X0,u1r2(X0)) ),
    inference(clausification,[status(esa)],[clause_7]) ).

cnf(c8,plain,
    ( ~ d(X0)
    | t1most(X0) ),
    inference(clausification,[status(esa)],[clause_9]) ).

cnf(c10,plain,
    ( ~ t(X2,X1)
    | ~ t(X2,X0)
    | ~ t1most(X2)
    | equalish(X0,X1) ),
    inference(clausification,[status(esa)],[clause_11]) ).

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

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

cnf(c25,plain,
    ( ~ s(X0,X2)
    | ~ s(X0,X1)
    | equalish(X1,X2)
    | s2least(X0) ),
    inference(clausification,[status(esa)],[clause_26]) ).

cnf(c27,plain,
    ( ~ s1most(u6r1(X0))
    | f(X0) ),
    inference(clausification,[status(esa)],[clause_28]) ).

cnf(c28,plain,
    ( r(X0,u6r1(X0))
    | f(X0) ),
    inference(clausification,[status(esa)],[clause_29]) ).

cnf(c30,plain,
    ( ~ equalish(u7r2(X0),u7r1(X0))
    | s1most(X0) ),
    inference(clausification,[status(esa)],[clause_31]) ).

cnf(c31,plain,
    ( s(X0,u7r1(X0))
    | s1most(X0) ),
    inference(clausification,[status(esa)],[clause_32]) ).

cnf(c32,plain,
    ( s(X0,u7r2(X0))
    | s1most(X0) ),
    inference(clausification,[status(esa)],[clause_33]) ).

cnf(d0,plain,
    ( f(X0)
    | d(u6r1(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[c14,c28]) ).

cnf(d1,plain,
    ( t1most(u6r1(X0))
    | f(X0)
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d0,c8]) ).

cnf(d2,plain,
    ( ~ t2least(X1)
    | ~ t1most(X1)
    | ~ t(X1,X0)
    | equalish(X0,u1r1(X1)) ),
    inference(resolution,[status(thm)],[c10,c5]) ).

cnf(d3,plain,
    ( ~ t2least(X0)
    | ~ t1most(X0)
    | ~ t(X0,u1r2(X0))
    | ~ t2least(X0) ),
    inference(resolution,[status(thm)],[d2,c4]) ).

cnf(d4,plain,
    ( ~ t2least(X0)
    | ~ t1most(X0)
    | ~ t2least(X0) ),
    inference(resolution,[status(thm)],[d3,c6]) ).

cnf(d5,plain,
    ( f(X0)
    | ~ e(X0)
    | ~ t2least(u6r1(X0)) ),
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    ( f(X0)
    | ~ s2least(u6r1(X0))
    | c(u6r1(X0))
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[c15,c28]) ).

cnf(d7,plain,
    ( s1most(X0)
    | ~ s(X0,X1)
    | s2least(X0)
    | equalish(u7r2(X0),X1) ),
    inference(resolution,[status(thm)],[c25,c32]) ).

cnf(d8,plain,
    ( s1most(X0)
    | s1most(X0)
    | ~ s(X0,u7r1(X0))
    | s2least(X0) ),
    inference(resolution,[status(thm)],[d7,c30]) ).

cnf(d9,plain,
    ( s1most(X0)
    | s1most(X0)
    | s2least(X0) ),
    inference(resolution,[status(thm)],[d8,c31]) ).

cnf(d10,plain,
    ( f(X0)
    | s2least(u6r1(X0)) ),
    inference(resolution,[status(thm)],[d9,c27]) ).

cnf(d11,plain,
    ( c(u6r1(X0))
    | f(X0)
    | ~ e(X0)
    | f(X0) ),
    inference(resolution,[status(thm)],[d10,d6]) ).

cnf(d12,plain,
    ( t2least(u6r1(X0))
    | f(X0)
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d11,c2]) ).

cnf(d13,plain,
    ( f(X0)
    | ~ e(X0)
    | f(X0)
    | ~ e(X0) ),
    inference(resolution,[status(thm)],[d12,d5]) ).

cnf(d14,plain,
    f(exist),
    inference(resolution,[status(thm)],[d13,c0]) ).

cnf(d15,plain,
    $false,
    inference(resolution,[status(thm)],[c1,d14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS013-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.09/0.57  % Computer : n002.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Fri Sep 25 19:35:51 UTC 2026
% 0.09/0.58  % CPUTime  : 
% 0.09/0.58  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.35/1.99  % SZS status Unsatisfiable for theBenchmark.p
% 10.35/1.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------