↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC218-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 05:18:46 PM UTC 2026

% Result   : Unsatisfiable 1.28s 1.72s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   54 (  33 unt;   2 nHn;  54 RR)
%            Number of literals    :   93 (  38 equ;  41 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
    app(app(sk5,cons(sk7,nil)),sk6) = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

cnf(co1_12,negated_conjecture,
    ~ neq(sk1,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(clause100,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(clause119,axiom,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).

cnf(co1_8,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

cnf(clause85,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).

cnf(co1_7,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(clause86,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).

cnf(co1_10,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

cnf(co1_9,negated_conjecture,
    app(sk5,sk6) = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(clause73,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).

cnf(clause118,axiom,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).

cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

cnf(clause99,axiom,
    ( cons(X1,X2) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).

cnf(c_0_18,negated_conjecture,
    app(app(sk5,cons(sk7,nil)),sk6) = sk3,
    co1_11 ).

cnf(c_0_19,negated_conjecture,
    sk1 = sk3,
    co1_6 ).

cnf(c_0_20,negated_conjecture,
    ~ neq(sk1,nil),
    co1_12 ).

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

cnf(c_0_22,negated_conjecture,
    ssList(sk1),
    co1_1 ).

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

cnf(c_0_24,negated_conjecture,
    app(app(sk5,cons(sk7,nil)),sk6) = sk1,
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    sk1 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).

cnf(c_0_26,axiom,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause119 ).

cnf(c_0_27,negated_conjecture,
    app(app(sk5,cons(sk7,nil)),sk6) = nil,
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ssList(sk6),
    co1_8 ).

cnf(c_0_29,negated_conjecture,
    ( sk6 = nil
    | ~ ssList(app(sk5,cons(sk7,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

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

cnf(c_0_31,negated_conjecture,
    ssList(sk5),
    co1_7 ).

cnf(c_0_32,negated_conjecture,
    ( sk6 = nil
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

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

cnf(c_0_34,negated_conjecture,
    ssItem(sk7),
    co1_10 ).

cnf(c_0_35,negated_conjecture,
    app(sk5,sk6) = sk4,
    co1_9 ).

cnf(c_0_36,negated_conjecture,
    sk6 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_23])]) ).

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

cnf(c_0_38,negated_conjecture,
    app(sk5,nil) = sk4,
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    sk5 = sk4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).

cnf(c_0_40,axiom,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause118 ).

cnf(c_0_41,negated_conjecture,
    app(app(sk4,cons(sk7,nil)),nil) = nil,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_36]),c_0_39]) ).

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

cnf(c_0_43,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_44,negated_conjecture,
    ( app(sk4,cons(sk7,nil)) = nil
    | ~ ssList(app(sk4,cons(sk7,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_23])]) ).

cnf(c_0_45,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    ( app(sk4,cons(sk7,nil)) = nil
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_45])]) ).

cnf(c_0_47,negated_conjecture,
    ( sk4 = nil
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_46]),c_0_45])]) ).

cnf(c_0_48,negated_conjecture,
    sk4 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_34]),c_0_23])]) ).

cnf(c_0_49,negated_conjecture,
    ( app(nil,cons(sk7,nil)) = nil
    | ~ ssList(cons(sk7,nil)) ),
    inference(rw,[status(thm)],[c_0_46,c_0_48]) ).

cnf(c_0_50,negated_conjecture,
    ( cons(sk7,nil) = nil
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_23])]) ).

cnf(c_0_51,axiom,
    ( cons(X1,X2) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause99 ).

cnf(c_0_52,negated_conjecture,
    cons(sk7,nil) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_33]),c_0_34]),c_0_23])]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC218-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n016.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 04:37:51 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.28/1.72  % Version  : CSE_E---1.7
% 1.28/1.72  % Problem  : theBenchmark.p
% 1.28/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72  % SZS output start CNFRefutation
% See solution above
% 1.28/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------