↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC333-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 : n003.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:55:01 AM UTC 2026

% Result   : Unsatisfiable 29.05s 4.18s
% Output   : CNFRefutation 29.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   41 (  17 unt;   0 nHn;  41 RR)
%            Number of literals    :   96 (   4 equ;  65 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    segmentP(sk4,sk3) ).

cnf(co1_8,negated_conjecture,
    totalorderedP(sk3) ).

cnf(co1_9,negated_conjecture,
    ( ~ totalorderedP(X0)
    | ~ segmentP(X0,sk3)
    | ~ segmentP(sk4,X0)
    | ~ neq(sk3,X0)
    | ~ ssList(X0) ) ).

cnf(co1_10,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | ssList(sk5) ) ).

cnf(co1_11,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | neq(sk1,sk5) ) ).

cnf(co1_12,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk2,sk5) ) ).

cnf(co1_13,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk5,sk1) ) ).

cnf(co1_14,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ) ).

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

cnf(c5,plain,
    sk1 = sk3,
    inference(clausification,[status(esa)],[co1_6]) ).

cnf(c6,plain,
    segmentP(sk4,sk3),
    inference(clausification,[status(esa)],[co1_7]) ).

cnf(c7,plain,
    totalorderedP(sk3),
    inference(clausification,[status(esa)],[co1_8]) ).

cnf(c8,plain,
    ( ~ totalorderedP(X0)
    | ~ neq(sk3,X0)
    | ~ segmentP(X0,sk3)
    | ~ segmentP(sk4,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[co1_9]) ).

cnf(c9,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | ssList(sk5) ),
    inference(clausification,[status(esa)],[co1_10]) ).

cnf(c10,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | neq(sk1,sk5) ),
    inference(clausification,[status(esa)],[co1_11]) ).

cnf(c11,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk2,sk5) ),
    inference(clausification,[status(esa)],[co1_12]) ).

cnf(c12,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk5,sk1) ),
    inference(clausification,[status(esa)],[co1_13]) ).

cnf(c13,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(clausification,[status(esa)],[co1_14]) ).

cnf(d0,plain,
    ( ~ neq(sk3,X0)
    | ~ totalorderedP(X0)
    | ~ segmentP(sk4,X0)
    | ~ segmentP(X0,sk1)
    | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[c8,c5]) ).

cnf(d1,plain,
    ( ~ neq(sk3,X0)
    | ~ totalorderedP(X0)
    | ~ segmentP(sk2,X0)
    | ~ segmentP(X0,sk1)
    | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[d0,c4]) ).

cnf(d2,plain,
    ( ~ neq(sk1,X0)
    | ~ totalorderedP(X0)
    | ~ segmentP(sk2,X0)
    | ~ segmentP(X0,sk1)
    | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[d1,c5]) ).

cnf(d3,plain,
    segmentP(sk2,sk3),
    inference(demodulation,[status(thm)],[c6,c4]) ).

cnf(d4,plain,
    segmentP(sk2,sk1),
    inference(demodulation,[status(thm)],[d3,c5]) ).

cnf(d5,plain,
    ( neq(sk1,sk5)
    | ~ totalorderedP(sk1) ),
    inference(resolution,[status(thm)],[d4,c10]) ).

cnf(d6,plain,
    ( ~ totalorderedP(sk5)
    | ~ segmentP(sk2,sk5)
    | ~ segmentP(sk5,sk1)
    | ~ ssList(sk5)
    | ~ totalorderedP(sk1) ),
    inference(resolution,[status(thm)],[d5,d2]) ).

cnf(d7,plain,
    totalorderedP(sk1),
    inference(demodulation,[status(thm)],[c7,c5]) ).

cnf(d8,plain,
    ( ~ totalorderedP(sk5)
    | ~ segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk5)
    | ~ ssList(sk5) ),
    inference(resolution,[status(thm)],[d7,d6]) ).

cnf(d9,plain,
    ( ~ totalorderedP(sk1)
    | ssList(sk5) ),
    inference(resolution,[status(thm)],[d4,c9]) ).

cnf(d10,plain,
    ssList(sk5),
    inference(resolution,[status(thm)],[d7,d9]) ).

cnf(d11,plain,
    ( ~ totalorderedP(sk5)
    | ~ segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk5) ),
    inference(resolution,[status(thm)],[d10,d8]) ).

cnf(d12,plain,
    ( totalorderedP(sk5)
    | ~ totalorderedP(sk1) ),
    inference(resolution,[status(thm)],[d4,c13]) ).

cnf(d13,plain,
    totalorderedP(sk5),
    inference(resolution,[status(thm)],[d7,d12]) ).

cnf(d14,plain,
    ( ~ segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk5) ),
    inference(resolution,[status(thm)],[d13,d11]) ).

cnf(d15,plain,
    ( ~ totalorderedP(sk1)
    | segmentP(sk2,sk5) ),
    inference(resolution,[status(thm)],[d4,c11]) ).

cnf(d16,plain,
    segmentP(sk2,sk5),
    inference(resolution,[status(thm)],[d7,d15]) ).

cnf(d17,plain,
    ~ segmentP(sk5,sk1),
    inference(resolution,[status(thm)],[d16,d14]) ).

cnf(d18,plain,
    ( ~ totalorderedP(sk1)
    | segmentP(sk5,sk1) ),
    inference(resolution,[status(thm)],[d4,c12]) ).

cnf(d19,plain,
    segmentP(sk5,sk1),
    inference(resolution,[status(thm)],[d7,d18]) ).

cnf(d20,plain,
    $false,
    inference(resolution,[status(thm)],[d19,d17]) ).

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