↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.37s 1.74s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   37 (  15 unt;  11 nHn;  37 RR)
%            Number of literals    :   70 (  23 equ;  26 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_21,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ equalelemsP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).

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

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

cnf(clause64,axiom,
    ( equalelemsP(cons(X1,nil))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).

cnf(co1_17,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

cnf(co1_8,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

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

cnf(co1_18,negated_conjecture,
    ( app(app(sk6,sk3),sk7) = sk4
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

cnf(co1_15,negated_conjecture,
    ( ssList(sk6)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

cnf(co1_16,negated_conjecture,
    ( ssList(sk7)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

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

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

cnf(c_0_14,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ equalelemsP(sk1) ),
    co1_21 ).

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

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

cnf(c_0_17,axiom,
    ( equalelemsP(cons(X1,nil))
    | ~ ssItem(X1) ),
    clause64 ).

cnf(c_0_18,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk3 ),
    co1_17 ).

cnf(c_0_19,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk3 ),
    co1_8 ).

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

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

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

cnf(c_0_23,negated_conjecture,
    ( ~ segmentP(sk4,sk3)
    | ~ equalelemsP(sk3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ( sk3 = nil
    | equalelemsP(sk3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_25,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_20]) ).

cnf(c_0_26,negated_conjecture,
    ( app(app(sk6,sk3),sk7) = sk4
    | nil = sk3 ),
    co1_18 ).

cnf(c_0_27,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_21,c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_22,c_0_15]) ).

cnf(c_0_29,negated_conjecture,
    ( ssList(sk6)
    | nil = sk3 ),
    co1_15 ).

cnf(c_0_30,negated_conjecture,
    ( ssList(sk7)
    | nil = sk3 ),
    co1_16 ).

cnf(c_0_31,negated_conjecture,
    ( sk3 = nil
    | ~ segmentP(sk4,sk3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    sk3 = nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),c_0_30]),c_0_31]) ).

cnf(c_0_33,axiom,
    equalelemsP(nil),
    clause1 ).

cnf(c_0_34,negated_conjecture,
    ~ segmentP(sk4,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_32]),c_0_32]),c_0_33])]) ).

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

cnf(c_0_36,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC330-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.33  % Computer : n007.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 05:54:39 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.37/1.74  % Version  : CSE_E---1.7
% 1.37/1.74  % Problem  : theBenchmark.p
% 1.37/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.74  % SZS output start CNFRefutation
% See solution above
% 1.37/1.74  % Total time : 1.372s
%------------------------------------------------------------------------------