↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 6.55s 37.66s
% Output   : CNFRefutation 6.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   53 (  24 unt;   0 nHn;  51 RR)
%            Number of literals    :  110 (  24 equ;  60 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   33 (   4 sgn)

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

cnf(co1_2,negated_conjecture,
    ssList(sk2) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

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

cnf(co1_9,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ neq(sk1,nil) ) ).

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

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

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

cnf(clause50,axiom,
    ssList(skaf46(X0,X1)) ).

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

cnf(clause85,axiom,
    ( ssList(app(X1,X0))
    | ~ ssList(X1)
    | ~ ssList(X0) ) ).

cnf(clause131,axiom,
    ( app(skaf46(X0,X1),X1) = X0
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ rearsegP(X0,X1) ) ).

cnf(clause173,axiom,
    ( segmentP(X3,X1)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X0)
    | ~ ssList(X2)
    | app(app(X0,X1),X2) != X3 ) ).

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

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

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(c8,plain,
    ( ~ segmentP(sk2,sk1)
    | ~ neq(sk1,nil) ),
    inference(clausification,[status(esa)],[co1_9]) ).

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

cnf(c10,plain,
    ( rearsegP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    inference(clausification,[status(esa)],[co1_11]) ).

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

cnf(c60,plain,
    ssList(skaf46(X0,X1)),
    inference(clausification,[status(esa)],[clause50]) ).

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

cnf(c95,plain,
    ( ssList(app(X1,X0))
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause85]) ).

cnf(c141,plain,
    ( app(skaf46(X0,X1),X1) = X0
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ rearsegP(X0,X1) ),
    inference(clausification,[status(esa)],[clause131]) ).

cnf(c183,plain,
    ( ~ ssList(X1)
    | ~ ssList(X0)
    | app(app(X3,X1),X2) != X0
    | ~ ssList(X3)
    | ~ ssList(X2)
    | segmentP(X0,X1) ),
    inference(clausification,[status(esa)],[clause173]) ).

cnf(d0,plain,
    ( rearsegP(sk4,sk3)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[c10,c4]) ).

cnf(d1,plain,
    ( rearsegP(sk2,sk3)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[d0,c4]) ).

cnf(d2,plain,
    ( rearsegP(sk2,sk1)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[d1,c5]) ).

cnf(d3,plain,
    rearsegP(sk2,sk1),
    inference(resolution,[status(thm)],[c6,d2]) ).

cnf(d4,plain,
    ( ~ ssList(sk2)
    | ~ ssList(sk1)
    | app(skaf46(sk2,sk1),sk1) = sk2 ),
    inference(resolution,[status(thm)],[c141,d3]) ).

cnf(d5,plain,
    ( ~ ssList(sk2)
    | app(skaf46(sk2,sk1),sk1) = sk2 ),
    inference(resolution,[status(thm)],[c0,d4]) ).

cnf(d6,plain,
    app(skaf46(sk2,sk1),sk1) = sk2,
    inference(resolution,[status(thm)],[c1,d5]) ).

cnf(d7,plain,
    ( segmentP(X1,sk1)
    | ~ ssList(skaf46(sk2,sk1))
    | ~ ssList(sk1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk2,X0) != X1 ),
    inference(superposition,[status(thm)],[d6,c183]) ).

cnf(d8,plain,
    ( segmentP(X1,sk1)
    | ~ ssList(skaf46(sk2,sk1))
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk2,X0) != X1 ),
    inference(resolution,[status(thm)],[c0,d7]) ).

cnf(d9,plain,
    ( segmentP(X1,sk1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk2,X0) != X1 ),
    inference(resolution,[status(thm)],[c60,d8]) ).

cnf(d10,plain,
    app(sk2,nil) = sk2,
    inference(resolution,[status(thm)],[c83,c1]) ).

cnf(d11,plain,
    ( app(app(X1,X0),nil) = app(X1,X0)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[c95,c83]) ).

cnf(d12,plain,
    ( ~ ssList(X0)
    | app(app(X0,nil),nil) = app(X0,nil) ),
    inference(resolution,[status(thm)],[d11,c18]) ).

cnf(d13,plain,
    app(app(sk2,nil),nil) = app(sk2,nil),
    inference(resolution,[status(thm)],[d12,c1]) ).

cnf(d14,plain,
    app(sk2,nil) = app(sk2,nil),
    inference(demodulation,[status(thm)],[d13,d10]) ).

cnf(d15,plain,
    sk2 = app(sk2,nil),
    inference(demodulation,[status(thm)],[d14,d10]) ).

cnf(d16,plain,
    ( segmentP(X0,sk1)
    | ~ ssList(nil)
    | ~ ssList(X0)
    | sk2 != X0 ),
    inference(superposition,[status(thm)],[d15,d9]) ).

cnf(d17,plain,
    ( segmentP(X0,sk1)
    | ~ ssList(X0)
    | sk2 != X0 ),
    inference(resolution,[status(thm)],[c18,d16]) ).

cnf(d18,plain,
    ( segmentP(sk2,sk1)
    | ~ ssList(sk2) ),
    inference(equality_resolution,[status(thm)],[d17]) ).

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

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

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

cnf(d22,plain,
    neq(sk1,nil),
    inference(resolution,[status(thm)],[c6,d21]) ).

cnf(d23,plain,
    ~ segmentP(sk2,sk1),
    inference(resolution,[status(thm)],[d22,c8]) ).

cnf(d24,plain,
    $false,
    inference(resolution,[status(thm)],[d23,d19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC122-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n018.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 12:20:37 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.55/37.66  % SZS status Unsatisfiable for theBenchmark.p
% 6.55/37.66  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------