↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : KRS012-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 : n013.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 9.70s 1.64s
% Output   : CNFRefutation 9.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (   6 unt;   6 nHn;  16 RR)
%            Number of literals    :   43 (   0 equ;  20 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    c(exists) ).

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

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

cnf(clause_4,axiom,
    ( ~ r(X1,X0)
    | ~ c(X1)
    | d(X0) ) ).

cnf(clause_12,axiom,
    ( ~ e(u1r1(X0))
    | f(X0) ) ).

cnf(clause_13,axiom,
    ( r(X0,u1r1(X0))
    | f(X0) ) ).

cnf(c0,plain,
    c(exists),
    inference(clausification,[status(esa)],[clause_1]) ).

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

cnf(c2,plain,
    ( ~ d(X0)
    | ~ r(X1,X0)
    | ~ c(X1)
    | e(X0) ),
    inference(clausification,[status(esa)],[clause_3]) ).

cnf(c3,plain,
    ( ~ r(X1,X0)
    | ~ c(X1)
    | d(X0) ),
    inference(clausification,[status(esa)],[clause_4]) ).

cnf(c11,plain,
    ( ~ e(u1r1(X0))
    | f(X0) ),
    inference(clausification,[status(esa)],[clause_12]) ).

cnf(c12,plain,
    ( r(X0,u1r1(X0))
    | f(X0) ),
    inference(clausification,[status(esa)],[clause_13]) ).

cnf(d0,plain,
    ( f(X0)
    | d(u1r1(X0))
    | ~ c(X0) ),
    inference(resolution,[status(thm)],[c3,c12]) ).

cnf(d1,plain,
    ( e(u1r1(X0))
    | ~ d(u1r1(X0))
    | ~ c(X0)
    | f(X0) ),
    inference(resolution,[status(thm)],[c12,c2]) ).

cnf(d2,plain,
    ( f(X0)
    | ~ c(X0)
    | e(u1r1(X0))
    | f(X0)
    | ~ c(X0) ),
    inference(resolution,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    ( f(X0)
    | f(X0)
    | ~ c(X0) ),
    inference(resolution,[status(thm)],[d2,c11]) ).

cnf(d4,plain,
    f(exists),
    inference(resolution,[status(thm)],[d3,c0]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c1,d4]) ).

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