↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN264-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 : n026.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 30.49s 4.52s
% Output   : CNFRefutation 30.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  12 unt;   0 nHn;  20 RR)
%            Number of literals    :   38 (   0 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   23 (  10 sgn)

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

cnf(axiom_5,axiom,
    s0(b) ).

cnf(axiom_20,axiom,
    l0(a) ).

cnf(axiom_26,axiom,
    n0(d,c) ).

cnf(axiom_28,axiom,
    k0(e) ).

cnf(rule_063,axiom,
    ( ~ k0(X1)
    | ~ n0(d,X0)
    | p1(X0,X0,X1) ) ).

cnf(rule_071,axiom,
    ( ~ s0(b)
    | ~ p1(X1,X3,X0)
    | ~ l0(X2)
    | p1(X0,X1,X0) ) ).

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

cnf(c5,plain,
    s0(b),
    inference(clausification,[status(esa)],[axiom_5]) ).

cnf(c20,plain,
    l0(a),
    inference(clausification,[status(esa)],[axiom_20]) ).

cnf(c26,plain,
    n0(d,c),
    inference(clausification,[status(esa)],[axiom_26]) ).

cnf(c28,plain,
    k0(e),
    inference(clausification,[status(esa)],[axiom_28]) ).

cnf(c101,plain,
    ( ~ k0(X1)
    | ~ n0(d,X0)
    | p1(X0,X0,X1) ),
    inference(clausification,[status(esa)],[rule_063]) ).

cnf(c109,plain,
    ( ~ s0(b)
    | ~ p1(X1,X3,X0)
    | ~ l0(X2)
    | p1(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_071]) ).

cnf(d0,plain,
    ( ~ l0(X3)
    | ~ p1(X1,X2,X0)
    | p1(X0,X1,X0) ),
    inference(resolution,[status(thm)],[c5,c109]) ).

cnf(d1,plain,
    ( ~ k0(X0)
    | ~ n0(d,X1)
    | ~ l0(X2)
    | p1(X0,X1,X0) ),
    inference(resolution,[status(thm)],[d0,c101]) ).

cnf(d2,plain,
    ( ~ k0(X0)
    | ~ l0(X1)
    | p1(X0,c,X0) ),
    inference(resolution,[status(thm)],[d1,c26]) ).

cnf(d3,plain,
    ( ~ l0(X0)
    | p1(e,c,e) ),
    inference(resolution,[status(thm)],[d2,c28]) ).

cnf(d4,plain,
    ~ l0(X0),
    inference(resolution,[status(thm)],[c0,d3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN264-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.17/0.42  % Computer : n026.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 17:30:27 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.49/4.52  % SZS status Unsatisfiable for theBenchmark.p
% 30.49/4.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------