↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n001.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:20:42 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause1,axiom,
    ( p
    | q ) ).

cnf(clause2,axiom,
    ( r
    | ~ q ) ).

cnf(clause3,axiom,
    ( s
    | ~ r ) ).

cnf(clause4,axiom,
    ( t
    | ~ r
    | ~ s ) ).

cnf(clause5,axiom,
    ( p
    | ~ t ) ).

cnf(prove_something,negated_conjecture,
    ~ p ).

cnf(c0,plain,
    ( p
    | q ),
    inference(clausification,[status(esa)],[clause1]) ).

cnf(c1,plain,
    ( r
    | ~ q ),
    inference(clausification,[status(esa)],[clause2]) ).

cnf(c2,plain,
    ( s
    | ~ r ),
    inference(clausification,[status(esa)],[clause3]) ).

cnf(c3,plain,
    ( t
    | ~ r
    | ~ s ),
    inference(clausification,[status(esa)],[clause4]) ).

cnf(c4,plain,
    ( p
    | ~ t ),
    inference(clausification,[status(esa)],[clause5]) ).

cnf(c5,plain,
    ~ p,
    inference(clausification,[status(esa)],[prove_something]) ).

cnf(d0,plain,
    q,
    inference(resolution,[status(thm)],[c5,c0]) ).

cnf(d1,plain,
    r,
    inference(resolution,[status(thm)],[d0,c1]) ).

cnf(d2,plain,
    ( t
    | ~ s ),
    inference(resolution,[status(thm)],[d1,c3]) ).

cnf(d3,plain,
    s,
    inference(resolution,[status(thm)],[d1,c2]) ).

cnf(d4,plain,
    t,
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ~ t,
    inference(resolution,[status(thm)],[c5,c4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN028-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n001.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:10:28 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.88/2.34  % SZS status Unsatisfiable for theBenchmark.p
% 3.88/2.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------