↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC024-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 : n015.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:17:57 PM UTC 2026

% Result   : Unsatisfiable 1.31s 1.72s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   39 (  20 unt;   2 nHn;  39 RR)
%            Number of literals    :   83 (  19 equ;  50 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

cnf(co1_8,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ frontsegP(sk2,X1)
    | ~ frontsegP(sk1,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_16,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ frontsegP(sk2,X1)
    | ~ frontsegP(sk1,X1) ),
    co1_8 ).

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

cnf(c_0_18,axiom,
    ( frontsegP(X3,X1)
    | app(X1,X2) != X3
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    clause144 ).

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

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

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

cnf(c_0_22,negated_conjecture,
    neq(sk4,nil),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    co1_13 ).

cnf(c_0_24,negated_conjecture,
    ( ~ neq(X1,nil)
    | ~ frontsegP(sk3,X1)
    | ~ frontsegP(sk4,X1)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).

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

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

cnf(c_0_27,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]) ).

cnf(c_0_28,negated_conjecture,
    app(sk3,sk5) = sk4,
    co1_10 ).

cnf(c_0_29,negated_conjecture,
    ssList(sk5),
    co1_9 ).

cnf(c_0_30,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_20,c_0_17]) ).

cnf(c_0_31,plain,
    ( ~ neq(X1,X1)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_32,negated_conjecture,
    ( neq(nil,nil)
    | sk3 != nil ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_33,negated_conjecture,
    ( nil = X1
    | ~ frontsegP(sk3,X1)
    | ~ frontsegP(sk4,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_34,negated_conjecture,
    frontsegP(sk4,sk3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).

cnf(c_0_35,negated_conjecture,
    sk3 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).

cnf(c_0_36,negated_conjecture,
    ~ frontsegP(sk3,sk3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30])]),c_0_35]) ).

cnf(c_0_37,axiom,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    clause61 ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWC024-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11  % 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 : n015.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.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 04:15:46 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.31/1.72  % Version  : CSE_E---1.7
% 1.31/1.72  % Problem  : theBenchmark.p
% 1.31/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.72  % SZS output start CNFRefutation
% See solution above
% 1.31/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------