↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 16.22s 3.01s
% Output   : CNFRefutation 16.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   9 unt;   0 nHn;   8 RR)
%            Number of literals    :   21 (   0 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   15 (  11 sgn)

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

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

cnf(axiom_17,axiom,
    q0(X0,d) ).

cnf(rule_125,axiom,
    ( ~ p0(X0,X0)
    | s1(X0) ) ).

cnf(rule_126,axiom,
    ( ~ s1(X2)
    | ~ q0(X0,X1)
    | s1(X0) ) ).

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

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

cnf(c17,plain,
    q0(X0,d),
    inference(clausification,[status(esa)],[axiom_17]) ).

cnf(c163,plain,
    ( ~ p0(X0,X0)
    | s1(X0) ),
    inference(clausification,[status(esa)],[rule_125]) ).

cnf(c164,plain,
    ( ~ s1(X2)
    | ~ q0(X0,X1)
    | s1(X0) ),
    inference(clausification,[status(esa)],[rule_126]) ).

cnf(d0,plain,
    s1(b),
    inference(resolution,[status(thm)],[c163,c14]) ).

cnf(d1,plain,
    ( ~ s1(X1)
    | s1(X0) ),
    inference(resolution,[status(thm)],[c164,c17]) ).

cnf(d2,plain,
    s1(X0),
    inference(resolution,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[d2,c0]) ).

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