↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n017.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:14 AM UTC 2026

% Result   : Unsatisfiable 73.23s 20.23s
% Output   : CNFRefutation 73.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   47 (  22 unt;   2 nHn;  47 RR)
%            Number of literals    :  108 (  23 equ;  66 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_3,negated_conjecture,
    ssList(sk3) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    neq(sk2,nil) ).

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

cnf(co1_9,negated_conjecture,
    ssList(sk5) ).

cnf(co1_10,negated_conjecture,
    app(sk3,sk5) = sk4 ).

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

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

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

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

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

cnf(clause172,axiom,
    ( segmentP(app(app(X3,X0),X2),X1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ segmentP(X0,X1) ) ).

cnf(c2,plain,
    ssList(sk3),
    inference(clausification,[status(esa)],[co1_3]) ).

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,
    neq(sk2,nil),
    inference(clausification,[status(esa)],[co1_7]) ).

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

cnf(c8,plain,
    ssList(sk5),
    inference(clausification,[status(esa)],[co1_9]) ).

cnf(c9,plain,
    app(sk3,sk5) = sk4,
    inference(clausification,[status(esa)],[co1_10]) ).

cnf(c12,plain,
    ( nil != sk3
    | nil = sk4 ),
    inference(clausification,[status(esa)],[co1_13]) ).

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

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

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

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

cnf(c184,plain,
    ( ~ segmentP(X2,X3)
    | ~ ssList(X3)
    | segmentP(app(app(X0,X2),X1),X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause172]) ).

cnf(d0,plain,
    ( ~ segmentP(sk2,X0)
    | ~ segmentP(sk3,X0)
    | ~ neq(X0,nil)
    | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[c7,c5]) ).

cnf(d1,plain,
    ( ~ segmentP(sk2,sk3)
    | ~ neq(sk3,nil)
    | ~ ssList(sk3)
    | ~ ssList(sk3) ),
    inference(resolution,[status(thm)],[c69,d0]) ).

cnf(d2,plain,
    ( ~ segmentP(sk2,sk3)
    | ~ neq(sk3,nil) ),
    inference(resolution,[status(thm)],[c2,d1]) ).

cnf(d3,plain,
    ( ~ ssList(X0)
    | ~ segmentP(X0,X2)
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(nil)
    | segmentP(app(X0,X1),X2) ),
    inference(superposition,[status(thm)],[c86,c184]) ).

cnf(d4,plain,
    ( segmentP(app(X2,X1),X0)
    | ~ segmentP(X2,X0)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[c20,d3]) ).

cnf(d5,plain,
    app(sk3,sk5) = sk2,
    inference(demodulation,[status(thm)],[c9,c4]) ).

cnf(d6,plain,
    ( ~ segmentP(sk3,X0)
    | ~ ssList(X0)
    | ~ ssList(sk5)
    | ~ ssList(sk3)
    | segmentP(sk2,X0) ),
    inference(superposition,[status(thm)],[d5,d4]) ).

cnf(d7,plain,
    ( ~ segmentP(sk3,X0)
    | segmentP(sk2,X0)
    | ~ ssList(sk5)
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[c2,d6]) ).

cnf(d8,plain,
    ( ~ segmentP(sk3,X0)
    | segmentP(sk2,X0)
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[c8,d7]) ).

cnf(d9,plain,
    ( ~ ssList(sk3)
    | segmentP(sk2,sk3)
    | ~ ssList(sk3) ),
    inference(resolution,[status(thm)],[d8,c69]) ).

cnf(d10,plain,
    segmentP(sk2,sk3),
    inference(resolution,[status(thm)],[c2,d9]) ).

cnf(d11,plain,
    ~ neq(sk3,nil),
    inference(resolution,[status(thm)],[d10,d2]) ).

cnf(d12,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk3)
    | sk3 = nil ),
    inference(resolution,[status(thm)],[d11,c112]) ).

cnf(d13,plain,
    ( ~ ssList(nil)
    | sk3 = nil ),
    inference(resolution,[status(thm)],[c2,d12]) ).

cnf(d14,plain,
    sk3 = nil,
    inference(resolution,[status(thm)],[c20,d13]) ).

cnf(d15,plain,
    ( nil = sk2
    | nil != sk3 ),
    inference(demodulation,[status(thm)],[c12,c4]) ).

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

cnf(d17,plain,
    nil = sk2,
    inference(equality_resolution,[status(thm)],[d16]) ).

cnf(d18,plain,
    neq(nil,nil),
    inference(demodulation,[status(thm)],[c6,d17]) ).

cnf(d19,plain,
    ~ neq(nil,nil),
    inference(demodulation,[status(thm)],[d11,d14]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC092-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46  % Computer : n017.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Sat Sep 26 12:09:35 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 73.23/20.23  % SZS status Unsatisfiable for theBenchmark.p
% 73.23/20.23  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------