↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n019.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 08:54:23 AM UTC 2026

% Result   : Unsatisfiable 7.82s 5.27s
% Output   : CNFRefutation 7.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  16 unt;   2 nHn;  20 RR)
%            Number of literals    :   29 (   7 equ;  13 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
    ssList(sk2) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_7,negated_conjecture,
    ~ neq(sk4,nil) ).

cnf(co1_8,negated_conjecture,
    ~ cyclefreeP(sk2) ).

cnf(clause7,axiom,
    cyclefreeP(nil) ).

cnf(clause8,axiom,
    ssList(nil) ).

cnf(clause100,axiom,
    ( X1 = X0
    | neq(X1,X0)
    | ~ ssList(X1)
    | ~ ssList(X0) ) ).

cnf(c1,plain,
    ssList(sk2),
    inference(clausification,[status(esa)],[co1_2]) ).

cnf(c4,plain,
    sk2 = sk4,
    inference(clausification,[status(esa)],[co1_5]) ).

cnf(c6,plain,
    ~ neq(sk4,nil),
    inference(clausification,[status(esa)],[co1_7]) ).

cnf(c7,plain,
    ~ cyclefreeP(sk2),
    inference(clausification,[status(esa)],[co1_8]) ).

cnf(c14,plain,
    cyclefreeP(nil),
    inference(clausification,[status(esa)],[clause7]) ).

cnf(c15,plain,
    ssList(nil),
    inference(clausification,[status(esa)],[clause8]) ).

cnf(c107,plain,
    ( X1 = X0
    | neq(X1,X0)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause100]) ).

cnf(d0,plain,
    ~ neq(sk2,nil),
    inference(demodulation,[status(thm)],[c6,c4]) ).

cnf(d1,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk2)
    | sk2 = nil ),
    inference(resolution,[status(thm)],[c107,d0]) ).

cnf(d2,plain,
    ( ~ ssList(nil)
    | sk2 = nil ),
    inference(resolution,[status(thm)],[c1,d1]) ).

cnf(d3,plain,
    sk2 = nil,
    inference(resolution,[status(thm)],[c15,d2]) ).

cnf(d4,plain,
    ~ cyclefreeP(nil),
    inference(demodulation,[status(thm)],[c7,d3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC131-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.44  % Computer : n019.cluster.edu
% 0.11/0.44  % Model    : x86_64 x86_64
% 0.11/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.44  % Memory   : 8046.5625MB
% 0.11/0.44  % OS       : Linux 6.8.0-71-generic
% 0.11/0.44  % CPULimit : 300
% 0.11/0.44  % WCLimit  : 300
% 0.11/0.44  % DateTime : Sat Sep 26 12:19:33 UTC 2026
% 0.11/0.45  % CPUTime  : 
% 0.11/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.82/5.27  % SZS status Unsatisfiable for theBenchmark.p
% 7.82/5.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------