↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 40.74s 5.83s
% Output   : CNFRefutation 40.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   55 (  14 unt;   6 nHn;  55 RR)
%            Number of literals    :  121 (  48 equ;  64 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_1,negated_conjecture,
    ssList(sk1) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    ( nil != sk4
    | nil = sk3 ) ).

cnf(co1_8,negated_conjecture,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ) ).

cnf(co1_9,negated_conjecture,
    ( segmentP(sk4,sk3)
    | ~ neq(sk4,nil) ) ).

cnf(co1_10,negated_conjecture,
    ( neq(sk2,nil)
    | nil = sk2 ) ).

cnf(co1_11,negated_conjecture,
    ( ~ segmentP(sk1,X0)
    | ~ segmentP(sk2,X0)
    | ~ neq(X0,nil)
    | ~ ssList(X0)
    | nil = sk2 ) ).

cnf(co1_12,negated_conjecture,
    ( neq(sk2,nil)
    | nil != sk1 ) ).

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

cnf(clause57,axiom,
    ( segmentP(X0,X0)
    | ~ ssList(X0) ) ).

cnf(clause73,axiom,
    ( app(X0,nil) = X0
    | ~ ssList(X0) ) ).

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

cnf(clause145,axiom,
    ( app(X0,X1) = nil
    | ~ ssList(X0)
    | ~ ssList(X1)
    | nil != X1
    | nil != X0 ) ).

cnf(c0,plain,
    ssList(sk1),
    inference(clausification,[status(esa)],[co1_1]) ).

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,
    ( nil != sk4
    | nil = sk3 ),
    inference(clausification,[status(esa)],[co1_7]) ).

cnf(c7,plain,
    ( neq(sk3,nil)
    | ~ neq(sk4,nil) ),
    inference(clausification,[status(esa)],[co1_8]) ).

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

cnf(c9,plain,
    ( neq(sk2,nil)
    | nil = sk2 ),
    inference(clausification,[status(esa)],[co1_10]) ).

cnf(c10,plain,
    ( nil = sk2
    | ~ neq(X0,nil)
    | ~ segmentP(sk2,X0)
    | ~ segmentP(sk1,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[co1_11]) ).

cnf(c11,plain,
    ( neq(sk2,nil)
    | nil != sk1 ),
    inference(clausification,[status(esa)],[co1_12]) ).

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

cnf(c69,plain,
    ( segmentP(X0,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause57]) ).

cnf(c85,plain,
    ( app(X0,nil) = X0
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause73]) ).

cnf(c127,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | ~ neq(X0,X1)
    | X0 != X1 ),
    inference(clausification,[status(esa)],[clause115]) ).

cnf(c157,plain,
    ( ~ ssList(X1)
    | nil != X1
    | ~ ssList(X0)
    | nil != X0
    | app(X0,X1) = nil ),
    inference(clausification,[status(esa)],[clause145]) ).

cnf(d0,plain,
    ( ~ neq(X0,X0)
    | ~ ssList(X0)
    | ~ ssList(X0) ),
    inference(equality_resolution,[status(thm)],[c127]) ).

cnf(d1,plain,
    ( nil != sk4
    | nil = sk1 ),
    inference(demodulation,[status(thm)],[c6,c5]) ).

cnf(d2,plain,
    ( nil != sk2
    | nil = sk1 ),
    inference(demodulation,[status(thm)],[d1,c4]) ).

cnf(d3,plain,
    ( ~ neq(sk4,nil)
    | neq(sk1,nil) ),
    inference(demodulation,[status(thm)],[c7,c5]) ).

cnf(d4,plain,
    ( ~ neq(sk2,nil)
    | neq(sk1,nil) ),
    inference(demodulation,[status(thm)],[d3,c4]) ).

cnf(d5,plain,
    ( neq(sk1,nil)
    | nil = sk2 ),
    inference(resolution,[status(thm)],[c9,d4]) ).

cnf(d6,plain,
    ( segmentP(sk4,sk3)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[c8,c4]) ).

cnf(d7,plain,
    ( segmentP(sk2,sk3)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[d6,c4]) ).

cnf(d8,plain,
    ( segmentP(sk2,sk1)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[d7,c5]) ).

cnf(d9,plain,
    ( segmentP(sk2,sk1)
    | nil = sk2 ),
    inference(resolution,[status(thm)],[c9,d8]) ).

cnf(d10,plain,
    ( ~ segmentP(sk1,sk1)
    | ~ neq(sk1,nil)
    | ~ ssList(sk1)
    | nil = sk2
    | nil = sk2 ),
    inference(resolution,[status(thm)],[d9,c10]) ).

cnf(d11,plain,
    ( ~ segmentP(sk1,sk1)
    | ~ neq(sk1,nil)
    | nil = sk2 ),
    inference(resolution,[status(thm)],[c0,d10]) ).

cnf(d12,plain,
    ( ~ ssList(sk1)
    | ~ neq(sk1,nil)
    | nil = sk2 ),
    inference(resolution,[status(thm)],[d11,c69]) ).

cnf(d13,plain,
    ( ~ neq(sk1,nil)
    | nil = sk2 ),
    inference(resolution,[status(thm)],[c0,d12]) ).

cnf(d14,plain,
    ( nil = sk2
    | nil = sk2 ),
    inference(resolution,[status(thm)],[d13,d5]) ).

cnf(d15,plain,
    nil = sk1,
    inference(resolution,[status(thm)],[d14,d2]) ).

cnf(d16,plain,
    ( neq(nil,nil)
    | nil != sk1 ),
    inference(demodulation,[status(thm)],[c11,d14]) ).

cnf(d17,plain,
    ( neq(nil,nil)
    | nil != nil ),
    inference(demodulation,[status(thm)],[d16,d15]) ).

cnf(d18,plain,
    app(nil,nil) = nil,
    inference(resolution,[status(thm)],[c85,c20]) ).

cnf(d19,plain,
    ( ~ ssList(nil)
    | ~ ssList(X0)
    | app(nil,X0) = nil
    | nil != X0 ),
    inference(equality_resolution,[status(thm)],[c157]) ).

cnf(d20,plain,
    ( ~ ssList(X0)
    | app(nil,X0) = nil
    | nil != X0 ),
    inference(resolution,[status(thm)],[c20,d19]) ).

cnf(d21,plain,
    ( ~ ssList(nil)
    | app(nil,nil) = nil ),
    inference(equality_resolution,[status(thm)],[d20]) ).

cnf(d22,plain,
    ( ~ ssList(nil)
    | nil = nil ),
    inference(demodulation,[status(thm)],[d21,d18]) ).

cnf(d23,plain,
    nil = nil,
    inference(resolution,[status(thm)],[c20,d22]) ).

cnf(d24,plain,
    neq(nil,nil),
    inference(resolution,[status(thm)],[d23,d17]) ).

cnf(d25,plain,
    ~ ssList(nil),
    inference(resolution,[status(thm)],[d24,d0]) ).

cnf(d26,plain,
    $false,
    inference(resolution,[status(thm)],[c20,d25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC059-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.17/0.42  % Computer : n003.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Sat Sep 26 12:11:08 UTC 2026
% 0.17/0.42  % CPUTime  : 
% 0.17/0.42  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 40.74/5.83  % SZS status Unsatisfiable for theBenchmark.p
% 40.74/5.83  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------