↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n012.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:19:10 PM UTC 2026

% Result   : Unsatisfiable 1.14s 1.61s
% Output   : CNFRefutation 1.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   50 (  12 unt;   7 nHn;  50 RR)
%            Number of literals    :  109 (  56 equ;  57 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
    ( neq(sk2,nil)
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

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

cnf(co1_11,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_9,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

cnf(co1_7,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

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

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

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

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

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

cnf(co1_8,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_12,negated_conjecture,
    ( nil = sk2
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_10,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

cnf(co1_13,negated_conjecture,
    ( nil = sk2
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) != sk1
    | app(X2,cons(X1,nil)) != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

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

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

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

cnf(c_0_17,negated_conjecture,
    ( neq(sk4,nil)
    | sk1 != nil ),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

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

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

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

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

cnf(c_0_22,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk4
    | sk1 != nil ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ( ssList(sk6)
    | sk1 != nil ),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    ( sk1 = nil
    | sk4 != nil ),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk4 != nil
    | ~ ssList(cons(sk5,nil)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).

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

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

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

cnf(c_0_29,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk4 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

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

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

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

cnf(c_0_33,negated_conjecture,
    ( nil = sk2
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) != sk1
    | app(X2,cons(X1,nil)) != sk2 ),
    co1_13 ).

cnf(c_0_34,negated_conjecture,
    ( sk4 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]) ).

cnf(c_0_35,negated_conjecture,
    ( ssItem(sk5)
    | sk1 != nil ),
    inference(spm,[status(thm)],[c_0_30,c_0_17]) ).

cnf(c_0_36,negated_conjecture,
    ( sk4 = nil
    | neq(sk4,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_15]),c_0_15]) ).

cnf(c_0_37,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk1
    | ~ neq(sk4,nil) ),
    inference(rw,[status(thm)],[c_0_32,c_0_20]) ).

cnf(c_0_38,negated_conjecture,
    ( sk4 = nil
    | app(X1,cons(X2,nil)) != sk4
    | app(cons(X2,nil),X1) != sk1
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_15]),c_0_15]) ).

cnf(c_0_39,negated_conjecture,
    sk4 != nil,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24]) ).

cnf(c_0_40,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk4
    | sk4 = nil ),
    inference(spm,[status(thm)],[c_0_16,c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk1
    | sk4 = nil ),
    inference(spm,[status(thm)],[c_0_37,c_0_36]) ).

cnf(c_0_42,negated_conjecture,
    ( sk4 = nil
    | ssItem(sk5) ),
    inference(spm,[status(thm)],[c_0_30,c_0_36]) ).

cnf(c_0_43,negated_conjecture,
    ( sk4 = nil
    | ssList(sk6) ),
    inference(spm,[status(thm)],[c_0_18,c_0_36]) ).

cnf(c_0_44,negated_conjecture,
    ( app(X1,cons(X2,nil)) != sk4
    | app(cons(X2,nil),X1) != sk1
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(sr,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    app(sk6,cons(sk5,nil)) = sk4,
    inference(sr,[status(thm)],[c_0_40,c_0_39]) ).

cnf(c_0_46,negated_conjecture,
    app(cons(sk5,nil),sk6) = sk1,
    inference(sr,[status(thm)],[c_0_41,c_0_39]) ).

cnf(c_0_47,negated_conjecture,
    ssItem(sk5),
    inference(sr,[status(thm)],[c_0_42,c_0_39]) ).

cnf(c_0_48,negated_conjecture,
    ssList(sk6),
    inference(sr,[status(thm)],[c_0_43,c_0_39]) ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),c_0_48])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SWC320-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.06  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24  % Computer : n012.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Tue May  5 04:43:31 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.14/1.61  % Version  : CSE_E---1.7
% 1.14/1.61  % Problem  : theBenchmark.p
% 1.14/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.14/1.61  % SZS output start CNFRefutation
% See solution above
% 1.14/1.61  % Total time : 1.361s
%------------------------------------------------------------------------------