↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 17.80s 2.85s
% Output   : CNFRefutation 17.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  12 unt;   0 nHn;  18 RR)
%            Number of literals    :   36 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   31 (  16 sgn)

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

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

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

cnf(rule_002,axiom,
    ( ~ n0(X1,X0)
    | l1(X0,X0) ) ).

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

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

cnf(rule_244,axiom,
    ( ~ n2(X0)
    | p3(X0,X0,X0) ) ).

cnf(rule_299,axiom,
    ( ~ l1(X0,X2)
    | ~ p3(X1,X2,X3)
    | s4(X0) ) ).

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

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

cnf(c37,plain,
    n0(b,a),
    inference(clausification,[status(esa)],[axiom_37]) ).

cnf(c40,plain,
    ( ~ n0(X1,X0)
    | l1(X0,X0) ),
    inference(clausification,[status(esa)],[rule_002]) ).

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(c282,plain,
    ( ~ n2(X0)
    | p3(X0,X0,X0) ),
    inference(clausification,[status(esa)],[rule_244]) ).

cnf(c337,plain,
    ( ~ l1(X0,X2)
    | ~ p3(X1,X2,X3)
    | s4(X0) ),
    inference(clausification,[status(esa)],[rule_299]) ).

cnf(d0,plain,
    l1(a,a),
    inference(resolution,[status(thm)],[c40,c37]) ).

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

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

cnf(d3,plain,
    p3(X0,X0,X0),
    inference(resolution,[status(thm)],[d2,c282]) ).

cnf(d4,plain,
    ( ~ l1(X0,X1)
    | s4(X0) ),
    inference(resolution,[status(thm)],[c337,d3]) ).

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

cnf(d6,plain,
    $false,
    inference(resolution,[status(thm)],[c0,d5]) ).

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