↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC211-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 : n014.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:45 PM UTC 2026

% Result   : Unsatisfiable 1.30s 1.72s
% Output   : CNFRefutation 1.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   51 (  26 unt;   6 nHn;  47 RR)
%            Number of literals    :  112 (  46 equ;  59 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;   5 con; 0-2 aty)
%            Number of variables   :   43 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
    ~ neq(sk1,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(clause109,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).

cnf(clause12,axiom,
    ssItem(skaf83(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).

cnf(clause13,axiom,
    ssList(skaf82(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).

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

cnf(c_0_17,negated_conjecture,
    ~ neq(sk1,nil),
    co1_9 ).

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

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

cnf(c_0_20,negated_conjecture,
    ~ neq(sk3,nil),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

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

cnf(c_0_22,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_19,c_0_18]) ).

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

cnf(c_0_24,negated_conjecture,
    ( app(X2,cons(X1,nil)) = sk3
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) != sk4 ),
    co1_8 ).

cnf(c_0_25,negated_conjecture,
    sk3 = 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,negated_conjecture,
    ( app(X1,cons(X2,nil)) = nil
    | app(cons(X2,nil),X1) != sk4
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

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

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

cnf(c_0_29,negated_conjecture,
    ( app(X1,cons(X2,nil)) = nil
    | cons(X2,X1) != sk4
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

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

cnf(c_0_31,negated_conjecture,
    ( nil = X1
    | cons(X2,X1) != sk4
    | ~ ssItem(X2)
    | ~ ssList(cons(X2,nil))
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

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

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

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

cnf(c_0_36,negated_conjecture,
    ( app(nil,cons(X1,nil)) = nil
    | cons(X1,nil) != sk4
    | ~ ssItem(X1)
    | ~ ssList(cons(X1,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_23])]) ).

cnf(c_0_37,negated_conjecture,
    ( nil = X1
    | cons(X2,X1) != sk4
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23])]) ).

cnf(c_0_38,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    clause109 ).

cnf(c_0_39,axiom,
    ssItem(skaf83(X1)),
    clause12 ).

cnf(c_0_40,axiom,
    ssList(skaf82(X1)),
    clause13 ).

cnf(c_0_41,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_42,negated_conjecture,
    ( cons(X1,nil) = nil
    | cons(X1,nil) != sk4
    | ~ ssItem(X1)
    | ~ ssList(cons(X1,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_23])]) ).

cnf(c_0_43,negated_conjecture,
    ( skaf82(sk4) = nil
    | sk4 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])])]),c_0_41])]) ).

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

cnf(c_0_45,negated_conjecture,
    ( cons(X1,nil) = nil
    | cons(X1,nil) != sk4
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_23])]) ).

cnf(c_0_46,negated_conjecture,
    ( cons(skaf83(sk4),nil) = sk4
    | sk4 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_43]),c_0_41])]) ).

cnf(c_0_47,negated_conjecture,
    neq(sk4,nil),
    inference(rw,[status(thm)],[c_0_44,c_0_34]) ).

cnf(c_0_48,negated_conjecture,
    sk4 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_39])]) ).

cnf(c_0_49,negated_conjecture,
    ~ neq(nil,nil),
    inference(rw,[status(thm)],[c_0_20,c_0_25]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC211-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12  % 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.14/0.32  % Computer : n014.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 04:34:06 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.30/1.72  % Version  : CSE_E---1.7
% 1.30/1.72  % Problem  : theBenchmark.p
% 1.30/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.72  % SZS output start CNFRefutation
% See solution above
% 1.30/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------