↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n010.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:41 AM UTC 2026

% Result   : Unsatisfiable 22.19s 4.23s
% Output   : CNFRefutation 22.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   37 (  17 unt;   0 nHn;  28 RR)
%            Number of literals    :   66 (   0 equ;  31 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   60 (  17 sgn)

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

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

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

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

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

cnf(rule_059,axiom,
    ( ~ m0(X1,X2,X0)
    | ~ m0(X2,X3,X3)
    | n1(X0,X0,X1) ) ).

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

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

cnf(rule_152,axiom,
    ( ~ p2(X0,X1,X0)
    | ~ p0(X0,X1)
    | ~ n1(X2,X1,X2)
    | p2(X0,X1,X1) ) ).

cnf(rule_176,axiom,
    ( ~ m1(X1,X0,X1)
    | p2(X0,X1,X0) ) ).

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

cnf(rule_251,axiom,
    ( ~ p2(X0,X1,X3)
    | ~ m3(X1,X2,X3)
    | p3(X0,X1,X1) ) ).

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

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

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

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

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

cnf(c97,plain,
    ( ~ m0(X1,X2,X0)
    | ~ m0(X2,X3,X3)
    | n1(X0,X0,X1) ),
    inference(clausification,[status(esa)],[rule_059]) ).

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(c190,plain,
    ( ~ p2(X0,X1,X0)
    | ~ p0(X0,X1)
    | ~ n1(X2,X1,X2)
    | p2(X0,X1,X1) ),
    inference(clausification,[status(esa)],[rule_152]) ).

cnf(c214,plain,
    ( ~ m1(X1,X0,X1)
    | p2(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_176]) ).

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

cnf(c289,plain,
    ( ~ p2(X0,X1,X3)
    | ~ m3(X1,X2,X3)
    | p3(X0,X1,X1) ),
    inference(clausification,[status(esa)],[rule_251]) ).

cnf(d0,plain,
    ( n1(X1,X1,X2)
    | ~ m0(d,X0,X0) ),
    inference(resolution,[status(thm)],[c97,c19]) ).

cnf(d1,plain,
    n1(X0,X0,X1),
    inference(resolution,[status(thm)],[d0,c19]) ).

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

cnf(d3,plain,
    p2(b,e,b),
    inference(resolution,[status(thm)],[c214,d2]) ).

cnf(d4,plain,
    ( p2(b,e,e)
    | ~ n1(X0,e,X0)
    | ~ p0(b,e) ),
    inference(resolution,[status(thm)],[d3,c190]) ).

cnf(d5,plain,
    ( p2(b,e,e)
    | ~ n1(X0,e,X0) ),
    inference(resolution,[status(thm)],[c14,d4]) ).

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

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

cnf(d8,plain,
    n2(X0),
    inference(resolution,[status(thm)],[d7,c175]) ).

cnf(d9,plain,
    m3(X0,X0,X0),
    inference(resolution,[status(thm)],[d8,c274]) ).

cnf(d10,plain,
    ( ~ p2(X0,X1,X1)
    | p3(X0,X1,X1) ),
    inference(resolution,[status(thm)],[c289,d9]) ).

cnf(d11,plain,
    p3(b,e,e),
    inference(resolution,[status(thm)],[d10,d6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n010.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 17:28:32 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.19/4.23  % SZS status Unsatisfiable for theBenchmark.p
% 22.19/4.23  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------