↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 21.57s 3.42s
% Output   : CNFRefutation 21.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  18 unt;   0 nHn;  31 RR)
%            Number of literals    :   62 (   0 equ;  29 neg)
%            Maximal clause size   :    3 (   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   :   44 (  16 sgn)

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

cnf(axiom_13,axiom,
    r0(e) ).

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

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

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

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

cnf(rule_092,axiom,
    ( ~ p0(X3,X0)
    | ~ n0(X2,X1)
    | q1(X0,X1,X0) ) ).

cnf(rule_141,axiom,
    ( ~ q1(X0,a,X0)
    | p2(X0,a,X0) ) ).

cnf(rule_155,axiom,
    ( ~ p2(e,X0,X1)
    | ~ k1(X2)
    | p2(X0,X1,X1) ) ).

cnf(rule_267,axiom,
    ( ~ p2(X0,X2,X1)
    | r3(X0,X1,X0) ) ).

cnf(rule_285,axiom,
    ( ~ r3(X1,X0,X1)
    | ~ r0(X0)
    | p4(X0,X0,X1) ) ).

cnf(rule_303,axiom,
    ( ~ p4(X0,X2,X1)
    | ~ r0(X0)
    | m5(X0,X1) ) ).

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

cnf(c13,plain,
    r0(e),
    inference(clausification,[status(esa)],[axiom_13]) ).

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(c37,plain,
    n0(b,a),
    inference(clausification,[status(esa)],[axiom_37]) ).

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

cnf(c130,plain,
    ( ~ p0(X3,X0)
    | ~ n0(X2,X1)
    | q1(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_092]) ).

cnf(c179,plain,
    ( ~ q1(X0,a,X0)
    | p2(X0,a,X0) ),
    inference(clausification,[status(esa)],[rule_141]) ).

cnf(c193,plain,
    ( ~ p2(e,X0,X1)
    | ~ k1(X2)
    | p2(X0,X1,X1) ),
    inference(clausification,[status(esa)],[rule_155]) ).

cnf(c305,plain,
    ( ~ p2(X0,X2,X1)
    | r3(X0,X1,X0) ),
    inference(clausification,[status(esa)],[rule_267]) ).

cnf(c323,plain,
    ( ~ r3(X1,X0,X1)
    | ~ r0(X0)
    | p4(X0,X0,X1) ),
    inference(clausification,[status(esa)],[rule_285]) ).

cnf(c341,plain,
    ( ~ p4(X0,X2,X1)
    | ~ r0(X0)
    | m5(X0,X1) ),
    inference(clausification,[status(esa)],[rule_303]) ).

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

cnf(d1,plain,
    ( q1(X2,X1,X2)
    | ~ n0(X0,X1) ),
    inference(resolution,[status(thm)],[c130,c14]) ).

cnf(d2,plain,
    q1(X0,a,X0),
    inference(resolution,[status(thm)],[d1,c37]) ).

cnf(d3,plain,
    p2(X0,a,X0),
    inference(resolution,[status(thm)],[d2,c179]) ).

cnf(d4,plain,
    ( p2(a,e,e)
    | ~ k1(X0) ),
    inference(resolution,[status(thm)],[d3,c193]) ).

cnf(d5,plain,
    p2(a,e,e),
    inference(resolution,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    r3(a,e,a),
    inference(resolution,[status(thm)],[d5,c305]) ).

cnf(d7,plain,
    ( p4(e,e,a)
    | ~ r0(e) ),
    inference(resolution,[status(thm)],[d6,c323]) ).

cnf(d8,plain,
    p4(e,e,a),
    inference(resolution,[status(thm)],[c13,d7]) ).

cnf(d9,plain,
    ( ~ r0(e)
    | m5(e,a) ),
    inference(resolution,[status(thm)],[d8,c341]) ).

cnf(d10,plain,
    ~ r0(e),
    inference(resolution,[status(thm)],[c0,d9]) ).

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

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