↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n004.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:21:19 AM UTC 2026

% Result   : Unsatisfiable 21.91s 3.08s
% Output   : CNFRefutation 21.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   40 (  22 unt;   0 nHn;  36 RR)
%            Number of literals    :   71 (   0 equ;  34 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   43 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ k2(c,b) ).

cnf(axiom_15,axiom,
    n0(a,b) ).

cnf(axiom_19,axiom,
    m0(X0,d,X1) ).

cnf(axiom_24,axiom,
    l0(c) ).

cnf(axiom_30,axiom,
    n0(e,e) ).

cnf(axiom_31,axiom,
    m0(b,b,e) ).

cnf(axiom_32,axiom,
    k0(b) ).

cnf(rule_001,axiom,
    ( ~ n0(X1,X0)
    | k1(X0) ) ).

cnf(rule_005,axiom,
    ( ~ m0(X1,X1,X0)
    | m1(X0,X1,X0) ) ).

cnf(rule_021,axiom,
    ( ~ k0(X1)
    | ~ l0(X0)
    | m1(X0,X1,X0) ) ).

cnf(rule_110,axiom,
    ( ~ m0(X1,X2,X0)
    | q1(X0,X0,X0) ) ).

cnf(rule_127,axiom,
    ( ~ k2(X3,X1)
    | ~ k1(X3)
    | ~ m1(X2,X1,X0)
    | k2(X0,X1) ) ).

cnf(rule_129,axiom,
    ( ~ q1(X1,X0,X0)
    | k2(X0,X0) ) ).

cnf(c0,plain,
    ~ k2(c,b),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c15,plain,
    n0(a,b),
    inference(clausification,[status(esa)],[axiom_15]) ).

cnf(c19,plain,
    m0(X0,d,X1),
    inference(clausification,[status(esa)],[axiom_19]) ).

cnf(c24,plain,
    l0(c),
    inference(clausification,[status(esa)],[axiom_24]) ).

cnf(c30,plain,
    n0(e,e),
    inference(clausification,[status(esa)],[axiom_30]) ).

cnf(c31,plain,
    m0(b,b,e),
    inference(clausification,[status(esa)],[axiom_31]) ).

cnf(c32,plain,
    k0(b),
    inference(clausification,[status(esa)],[axiom_32]) ).

cnf(c39,plain,
    ( ~ n0(X1,X0)
    | k1(X0) ),
    inference(clausification,[status(esa)],[rule_001]) ).

cnf(c43,plain,
    ( ~ m0(X1,X1,X0)
    | m1(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_005]) ).

cnf(c59,plain,
    ( ~ k0(X1)
    | ~ l0(X0)
    | m1(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_021]) ).

cnf(c148,plain,
    ( ~ m0(X1,X2,X0)
    | q1(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_110]) ).

cnf(c165,plain,
    ( ~ k2(X3,X1)
    | ~ k1(X3)
    | ~ m1(X2,X1,X0)
    | k2(X0,X1) ),
    inference(clausification,[status(esa)],[rule_127]) ).

cnf(c167,plain,
    ( ~ q1(X1,X0,X0)
    | k2(X0,X0) ),
    inference(clausification,[status(esa)],[rule_129]) ).

cnf(d0,plain,
    ( ~ k0(X1)
    | ~ l0(X0)
    | ~ k1(X2)
    | ~ k2(X2,X1)
    | k2(X0,X1) ),
    inference(resolution,[status(thm)],[c165,c59]) ).

cnf(d1,plain,
    q1(X0,X0,X0),
    inference(resolution,[status(thm)],[c148,c19]) ).

cnf(d2,plain,
    k2(X0,X0),
    inference(resolution,[status(thm)],[c167,d1]) ).

cnf(d3,plain,
    m1(e,b,e),
    inference(resolution,[status(thm)],[c43,c31]) ).

cnf(d4,plain,
    ( ~ k1(X0)
    | ~ k2(X0,b)
    | k2(e,b) ),
    inference(resolution,[status(thm)],[c165,d3]) ).

cnf(d5,plain,
    ( ~ k1(b)
    | k2(e,b) ),
    inference(resolution,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    k1(b),
    inference(resolution,[status(thm)],[c39,c15]) ).

cnf(d7,plain,
    k2(e,b),
    inference(resolution,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    ( ~ k1(e)
    | ~ k0(b)
    | ~ l0(X0)
    | k2(X0,b) ),
    inference(resolution,[status(thm)],[d7,d0]) ).

cnf(d9,plain,
    ( ~ k1(e)
    | ~ l0(X0)
    | k2(X0,b) ),
    inference(resolution,[status(thm)],[c32,d8]) ).

cnf(d10,plain,
    k1(e),
    inference(resolution,[status(thm)],[c39,c30]) ).

cnf(d11,plain,
    ( ~ l0(X0)
    | k2(X0,b) ),
    inference(resolution,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    ~ l0(c),
    inference(resolution,[status(thm)],[d11,c0]) ).

cnf(d13,plain,
    $false,
    inference(resolution,[status(thm)],[c24,d12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN111-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 17:12:10 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.91/3.08  % SZS status Unsatisfiable for theBenchmark.p
% 21.91/3.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------