↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 8.62s 5.75s
% Output   : CNFRefutation 8.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   51 (  19 unt;   6 nHn;  49 RR)
%            Number of literals    :  113 (  29 equ;  64 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   :   38 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause173,axiom,
    ( segmentP(X4,X2)
    | app(app(X1,X2),X3) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).

cnf(co1_7,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(sk2,X1)
    | ~ segmentP(sk1,X1) ),
    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(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

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

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

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

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

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

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

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

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

cnf(co1_8,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(clause57,axiom,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).

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

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

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

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

cnf(c_0_19,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(sk2,X1)
    | ~ segmentP(sk1,X1) ),
    co1_7 ).

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

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

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

cnf(c_0_23,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_18]) ).

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

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

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

cnf(c_0_27,negated_conjecture,
    ( ~ neq(X1,nil)
    | ~ segmentP(sk3,X1)
    | ~ segmentP(sk4,X1)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    ( nil = sk3
    | neq(sk3,nil) ),
    co1_11 ).

cnf(c_0_29,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_22,c_0_20]) ).

cnf(c_0_30,plain,
    ( segmentP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_31,axiom,
    ( app(X2,skaf45(X1,X2)) = X1
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause132 ).

cnf(c_0_32,axiom,
    ssList(skaf45(X1,X2)),
    clause51 ).

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

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

cnf(c_0_35,plain,
    ( segmentP(X1,X2)
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_36,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_33,c_0_21]) ).

cnf(c_0_37,negated_conjecture,
    ( nil = sk3
    | frontsegP(sk4,sk3) ),
    co1_12 ).

cnf(c_0_38,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    co1_8 ).

cnf(c_0_39,negated_conjecture,
    ( sk3 = nil
    | ~ segmentP(sk3,sk3) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29]),c_0_36])]),c_0_37]) ).

cnf(c_0_40,axiom,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    clause57 ).

cnf(c_0_41,negated_conjecture,
    ( nil = sk4
    | neq(sk3,nil) ),
    co1_9 ).

cnf(c_0_42,axiom,
    ( segmentP(nil,X1)
    | nil != X1
    | ~ ssList(X1) ),
    clause79 ).

cnf(c_0_43,negated_conjecture,
    ( sk3 != nil
    | sk4 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_20]),c_0_21]) ).

cnf(c_0_44,negated_conjecture,
    sk3 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_29])]) ).

cnf(c_0_45,negated_conjecture,
    ( sk4 = nil
    | ~ segmentP(sk3,sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_41]),c_0_29])]) ).

cnf(c_0_46,plain,
    segmentP(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_42]),c_0_25])]) ).

cnf(c_0_47,negated_conjecture,
    sk4 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).

cnf(c_0_48,negated_conjecture,
    ~ segmentP(sk4,nil),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_44]),c_0_44]),c_0_46]),c_0_44])]),c_0_47]) ).

cnf(c_0_49,axiom,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    clause56 ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC070-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.16/0.33  % Computer : n020.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 04:22:35 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 8.62/5.75  % Version  : CSE_E---1.7
% 8.62/5.75  % Problem  : theBenchmark.p
% 8.62/5.75  % SZS status Unsatisfiable for theBenchmark.p
% 8.62/5.75  % SZS output start CNFRefutation
% See solution above
% 8.62/5.78  % Total time : 4.375s
%------------------------------------------------------------------------------