↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 101.74s 19.08s
% Output   : CNFRefutation 101.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   88 (  21 unt;   4 nHn;  78 RR)
%            Number of literals    :  236 (  64 equ; 167 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   74 (  10 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)
    | neq(sk2,nil) ) ).

cnf(co1_14,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(app(X2,cons(X0,nil)),X1) != sk1
    | app(app(X1,cons(X0,nil)),X2) != sk2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X0) ) ).

cnf(co1_15,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ) ).

cnf(co1_16,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ) ).

cnf(co1_17,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(cons(sk5,nil),sk6) = sk4 ) ).

cnf(co1_18,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(sk6,cons(sk5,nil)) = sk3 ) ).

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

cnf(clause72,axiom,
    ( ssItem(X1)
    | duplicatefreeP(X0)
    | ~ ssList(X0) ) ).

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

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

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

cnf(clause86,axiom,
    ( ssList(cons(X0,X1))
    | ~ ssList(X1)
    | ~ ssItem(X0) ) ).

cnf(clause120,axiom,
    ( app(cons(X0,nil),X1) = cons(X0,X1)
    | ~ ssList(X1)
    | ~ ssItem(X0) ) ).

cnf(clause149,axiom,
    ( app(app(X2,X1),X0) = app(X2,app(X1,X0))
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ) ).

cnf(clause179,axiom,
    ( ~ ssList(X4)
    | ~ duplicatefreeP(X4)
    | ~ ssItem(X1)
    | ~ ssList(X0)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ) ).

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(c13,plain,
    ( app(app(X2,cons(X0,nil)),X1) != sk1
    | ~ ssList(X2)
    | app(app(X1,cons(X0,nil)),X2) != sk2
    | ~ ssList(X1)
    | ~ neq(sk4,nil)
    | ~ ssItem(X0) ),
    inference(clausification,[status(esa)],[co1_14]) ).

cnf(c14,plain,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    inference(clausification,[status(esa)],[co1_15]) ).

cnf(c15,plain,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    inference(clausification,[status(esa)],[co1_16]) ).

cnf(c16,plain,
    ( ~ neq(sk4,nil)
    | app(cons(sk5,nil),sk6) = sk4 ),
    inference(clausification,[status(esa)],[co1_17]) ).

cnf(c17,plain,
    ( ~ neq(sk4,nil)
    | app(sk6,cons(sk5,nil)) = sk3 ),
    inference(clausification,[status(esa)],[co1_18]) ).

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

cnf(c89,plain,
    ( ssItem(X1)
    | duplicatefreeP(X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause72]) ).

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

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

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

cnf(c103,plain,
    ( ssList(cons(X0,X1))
    | ~ ssList(X1)
    | ~ ssItem(X0) ),
    inference(clausification,[status(esa)],[clause86]) ).

cnf(c137,plain,
    ( app(cons(X0,nil),X1) = cons(X0,X1)
    | ~ ssList(X1)
    | ~ ssItem(X0) ),
    inference(clausification,[status(esa)],[clause120]) ).

cnf(c166,plain,
    ( app(app(X2,X1),X0) = app(X2,app(X1,X0))
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause149]) ).

cnf(c196,plain,
    ( app(app(X4,cons(X2,X3)),cons(X2,X1)) != X0
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ duplicatefreeP(X0)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[clause179]) ).

cnf(d0,plain,
    ( duplicatefreeP(app(X0,X1))
    | ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[c102,c89]) ).

cnf(d1,plain,
    ( ~ neq(sk4,nil)
    | app(sk6,cons(sk5,nil)) = sk1 ),
    inference(demodulation,[status(thm)],[c17,c5]) ).

cnf(d2,plain,
    ( ~ neq(sk2,nil)
    | app(sk6,cons(sk5,nil)) = sk1 ),
    inference(demodulation,[status(thm)],[d1,c4]) ).

cnf(d3,plain,
    app(sk6,cons(sk5,nil)) = sk1,
    inference(resolution,[status(thm)],[c6,d2]) ).

cnf(d4,plain,
    ( ~ duplicatefreeP(X1)
    | ~ ssItem(sk5)
    | ~ ssList(nil)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(sk6)
    | app(sk1,cons(sk5,X0)) != X1 ),
    inference(superposition,[status(thm)],[d3,c196]) ).

cnf(d5,plain,
    ( ~ duplicatefreeP(X1)
    | ~ ssItem(sk5)
    | ~ ssList(sk6)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk1,cons(sk5,X0)) != X1 ),
    inference(resolution,[status(thm)],[c25,d4]) ).

cnf(d6,plain,
    ( ssItem(sk5)
    | ~ neq(sk2,nil) ),
    inference(demodulation,[status(thm)],[c14,c4]) ).

cnf(d7,plain,
    ssItem(sk5),
    inference(resolution,[status(thm)],[c6,d6]) ).

cnf(d8,plain,
    ( ~ duplicatefreeP(X1)
    | ~ ssList(sk6)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk1,cons(sk5,X0)) != X1 ),
    inference(resolution,[status(thm)],[d7,d5]) ).

cnf(d9,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk6) ),
    inference(demodulation,[status(thm)],[c15,c4]) ).

cnf(d10,plain,
    ssList(sk6),
    inference(resolution,[status(thm)],[c6,d9]) ).

cnf(d11,plain,
    ( ~ duplicatefreeP(X1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | app(sk1,cons(sk5,X0)) != X1 ),
    inference(resolution,[status(thm)],[d10,d8]) ).

cnf(d12,plain,
    ( ~ neq(sk4,nil)
    | app(cons(sk5,nil),sk6) = sk2 ),
    inference(demodulation,[status(thm)],[c16,c4]) ).

cnf(d13,plain,
    ( ~ neq(sk2,nil)
    | app(cons(sk5,nil),sk6) = sk2 ),
    inference(demodulation,[status(thm)],[d12,c4]) ).

cnf(d14,plain,
    app(cons(sk5,nil),sk6) = sk2,
    inference(resolution,[status(thm)],[c6,d13]) ).

cnf(d15,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(sk6)
    | cons(sk5,sk6) = sk2 ),
    inference(superposition,[status(thm)],[c137,d14]) ).

cnf(d16,plain,
    ( ~ ssList(sk6)
    | cons(sk5,sk6) = sk2 ),
    inference(resolution,[status(thm)],[d7,d15]) ).

cnf(d17,plain,
    cons(sk5,sk6) = sk2,
    inference(resolution,[status(thm)],[d10,d16]) ).

cnf(d18,plain,
    ( ~ duplicatefreeP(X0)
    | ~ ssList(sk6)
    | ~ ssList(X0)
    | app(sk1,sk2) != X0 ),
    inference(superposition,[status(thm)],[d17,d11]) ).

cnf(d19,plain,
    ( ~ duplicatefreeP(X0)
    | ~ ssList(X0)
    | app(sk1,sk2) != X0 ),
    inference(resolution,[status(thm)],[d10,d18]) ).

cnf(d20,plain,
    ( ~ duplicatefreeP(app(sk1,sk2))
    | ~ ssList(app(sk1,sk2)) ),
    inference(equality_resolution,[status(thm)],[d19]) ).

cnf(d21,plain,
    ( ssItem(X0)
    | ~ ssList(sk1)
    | ~ ssList(sk2)
    | ~ ssList(app(sk1,sk2)) ),
    inference(resolution,[status(thm)],[d20,d0]) ).

cnf(d22,plain,
    ( ssItem(X0)
    | ~ ssList(app(sk1,sk2))
    | ~ ssList(sk2) ),
    inference(resolution,[status(thm)],[c0,d21]) ).

cnf(d23,plain,
    ( ssItem(X0)
    | ~ ssList(app(sk1,sk2)) ),
    inference(resolution,[status(thm)],[c1,d22]) ).

cnf(d24,plain,
    ( ~ ssList(sk2)
    | ~ ssList(sk1)
    | ssItem(X0) ),
    inference(resolution,[status(thm)],[d23,c102]) ).

cnf(d25,plain,
    ( ssItem(X0)
    | ~ ssList(sk2) ),
    inference(resolution,[status(thm)],[c0,d24]) ).

cnf(d26,plain,
    ssItem(X0),
    inference(resolution,[status(thm)],[c1,d25]) ).

cnf(d27,plain,
    ( ssList(cons(X1,X0))
    | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[d26,c103]) ).

cnf(d28,plain,
    ( ~ ssItem(X1)
    | ~ neq(sk2,nil)
    | ~ ssList(X2)
    | ~ ssList(X0)
    | app(app(X2,cons(X1,nil)),X0) != sk2
    | app(app(X0,cons(X1,nil)),X2) != sk1 ),
    inference(demodulation,[status(thm)],[c13,c4]) ).

cnf(d29,plain,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X0)
    | app(app(X2,cons(X1,nil)),X0) != sk2
    | app(app(X0,cons(X1,nil)),X2) != sk1 ),
    inference(resolution,[status(thm)],[c6,d28]) ).

cnf(d30,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(sk6)
    | ~ ssList(X0)
    | app(app(X0,cons(sk5,nil)),sk6) != sk2
    | app(sk1,X0) != sk1 ),
    inference(superposition,[status(thm)],[d3,d29]) ).

cnf(d31,plain,
    ( ~ ssList(sk6)
    | ~ ssList(X0)
    | app(app(X0,cons(sk5,nil)),sk6) != sk2
    | app(sk1,X0) != sk1 ),
    inference(resolution,[status(thm)],[d7,d30]) ).

cnf(d32,plain,
    ( ~ ssList(X0)
    | app(app(X0,cons(sk5,nil)),sk6) != sk2
    | app(sk1,X0) != sk1 ),
    inference(resolution,[status(thm)],[d10,d31]) ).

cnf(d33,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(nil)
    | app(sk1,nil) != sk1
    | app(cons(sk5,nil),sk6) != sk2 ),
    inference(superposition,[status(thm)],[c91,d32]) ).

cnf(d34,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(nil)
    | sk2 != sk2
    | app(sk1,nil) != sk1 ),
    inference(demodulation,[status(thm)],[d33,d14]) ).

cnf(d35,plain,
    ( ~ ssList(cons(sk5,nil))
    | sk2 != sk2
    | app(sk1,nil) != sk1 ),
    inference(resolution,[status(thm)],[c25,d34]) ).

cnf(d36,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(sk6)
    | sk2 = cons(sk5,sk6) ),
    inference(superposition,[status(thm)],[d14,c137]) ).

cnf(d37,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(sk6)
    | sk2 = sk2 ),
    inference(demodulation,[status(thm)],[d36,d17]) ).

cnf(d38,plain,
    ( ~ ssList(sk6)
    | sk2 = sk2 ),
    inference(resolution,[status(thm)],[d7,d37]) ).

cnf(d39,plain,
    sk2 = sk2,
    inference(resolution,[status(thm)],[d10,d38]) ).

cnf(d40,plain,
    ( ~ ssList(cons(sk5,nil))
    | app(sk1,nil) != sk1 ),
    inference(resolution,[status(thm)],[d39,d35]) ).

cnf(d41,plain,
    ( ~ ssList(sk6)
    | ~ ssList(X0)
    | ~ ssList(cons(sk5,nil))
    | app(sk1,X0) = app(sk6,app(cons(sk5,nil),X0)) ),
    inference(superposition,[status(thm)],[d3,c166]) ).

cnf(d42,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(X0)
    | app(sk1,X0) = app(sk6,app(cons(sk5,nil),X0)) ),
    inference(resolution,[status(thm)],[d10,d41]) ).

cnf(d43,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(nil)
    | app(sk1,nil) = app(sk6,cons(sk5,nil)) ),
    inference(superposition,[status(thm)],[c90,d42]) ).

cnf(d44,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(nil)
    | app(sk1,nil) = sk1 ),
    inference(demodulation,[status(thm)],[d43,d3]) ).

cnf(d45,plain,
    ( ~ ssList(cons(sk5,nil))
    | app(sk1,nil) = sk1 ),
    inference(resolution,[status(thm)],[c25,d44]) ).

cnf(d46,plain,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk5,nil))
    | sk1 != sk1 ),
    inference(superposition,[status(thm)],[d45,d40]) ).

cnf(d47,plain,
    ~ ssList(cons(sk5,nil)),
    inference(equality_resolution,[status(thm)],[d46]) ).

cnf(d48,plain,
    ~ ssList(nil),
    inference(resolution,[status(thm)],[d47,d27]) ).

cnf(d49,plain,
    $false,
    inference(resolution,[status(thm)],[c25,d48]) ).

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