↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 20.48s 8.39s
% Output   : CNFRefutation 20.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   34 (  15 unt;   0 nHn;  26 RR)
%            Number of literals    :   60 (   0 equ;  28 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   50 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ l5(e) ).

cnf(axiom_14,axiom,
    p0(b,X0) ).

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

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

cnf(rule_085,axiom,
    ( ~ p0(X1,X0)
    | p1(X0,X0,X0) ) ).

cnf(rule_137,axiom,
    ( ~ p1(X1,X2,X0)
    | n2(X0) ) ).

cnf(rule_181,axiom,
    ( ~ p1(X0,X0,X0)
    | q2(X0,X0,X0) ) ).

cnf(rule_210,axiom,
    ( ~ n2(X0)
    | k3(X0,X0,X0) ) ).

cnf(rule_236,axiom,
    ( ~ n2(X0)
    | m3(X0,X0,X0) ) ).

cnf(rule_295,axiom,
    ( ~ m3(X3,X4,X3)
    | ~ q2(X3,X1,X0)
    | ~ k3(X2,X2,X0)
    | q4(X0,X1) ) ).

cnf(rule_302,axiom,
    ( ~ k1(X0)
    | ~ q4(X1,X1)
    | l5(X0) ) ).

cnf(c0,plain,
    ~ l5(e),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c14,plain,
    p0(b,X0),
    inference(clausification,[status(esa)],[axiom_14]) ).

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

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

cnf(c123,plain,
    ( ~ p0(X1,X0)
    | p1(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_085]) ).

cnf(c175,plain,
    ( ~ p1(X1,X2,X0)
    | n2(X0) ),
    inference(clausification,[status(esa)],[rule_137]) ).

cnf(c219,plain,
    ( ~ p1(X0,X0,X0)
    | q2(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_181]) ).

cnf(c248,plain,
    ( ~ n2(X0)
    | k3(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_210]) ).

cnf(c274,plain,
    ( ~ n2(X0)
    | m3(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_236]) ).

cnf(c333,plain,
    ( ~ m3(X3,X4,X3)
    | ~ q2(X3,X1,X0)
    | ~ k3(X2,X2,X0)
    | q4(X0,X1) ),
    inference(clausification,[status(esa)],[rule_295]) ).

cnf(c340,plain,
    ( ~ k1(X0)
    | ~ q4(X1,X1)
    | l5(X0) ),
    inference(clausification,[status(esa)],[rule_302]) ).

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

cnf(d1,plain,
    p1(X0,X0,X0),
    inference(resolution,[status(thm)],[c123,c14]) ).

cnf(d2,plain,
    q2(X0,X0,X0),
    inference(resolution,[status(thm)],[d1,c219]) ).

cnf(d3,plain,
    n2(X0),
    inference(resolution,[status(thm)],[d1,c175]) ).

cnf(d4,plain,
    k3(X0,X0,X0),
    inference(resolution,[status(thm)],[d3,c248]) ).

cnf(d5,plain,
    m3(X0,X0,X0),
    inference(resolution,[status(thm)],[d3,c274]) ).

cnf(d6,plain,
    ( q4(X2,X1)
    | ~ k3(X3,X3,X2)
    | ~ q2(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c333,d5]) ).

cnf(d7,plain,
    ( q4(X2,X1)
    | ~ q2(X0,X1,X2) ),
    inference(resolution,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    q4(X0,X0),
    inference(resolution,[status(thm)],[d7,d2]) ).

cnf(d9,plain,
    ( ~ k1(X0)
    | l5(X0) ),
    inference(resolution,[status(thm)],[d8,c340]) ).

cnf(d10,plain,
    l5(e),
    inference(resolution,[status(thm)],[d9,d0]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[c0,d10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN129-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/5.38  % Computer : n004.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.39  % CPULimit : 300
% 0.09/5.39  % WCLimit  : 300
% 0.09/5.39  % DateTime : Sat Sep 26 17:12:57 UTC 2026
% 0.09/5.39  % CPUTime  : 
% 0.09/5.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.48/8.39  % SZS status Unsatisfiable for theBenchmark.p
% 20.48/8.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------