↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.54s 1.78s
% Output   : CNFRefutation 1.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  12 unt;   8 nHn;  28 RR)
%            Number of literals    :   66 (  21 equ;  35 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-3 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
    ( nil = sk3
    | app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

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

cnf(co1_7,negated_conjecture,
    nil != sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

cnf(co1_11,negated_conjecture,
    ( lt(X1,sk5(X3,X2,X1))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_8,negated_conjecture,
    ( ssItem(sk5(X3,X2,X1))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_12,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1
    | ~ leq(X1,sk5(X3,X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(clause103,axiom,
    ( leq(X1,X2)
    | ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).

cnf(c_0_10,negated_conjecture,
    ( nil = sk3
    | app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
    co1_16 ).

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

cnf(c_0_12,negated_conjecture,
    nil != sk1,
    co1_7 ).

cnf(c_0_13,negated_conjecture,
    ( nil = sk3
    | ssItem(sk6) ),
    co1_13 ).

cnf(c_0_14,negated_conjecture,
    ( nil = sk3
    | ssList(sk8) ),
    co1_15 ).

cnf(c_0_15,negated_conjecture,
    ( nil = sk3
    | ssList(sk7) ),
    co1_14 ).

cnf(c_0_16,negated_conjecture,
    ( lt(X1,sk5(X3,X2,X1))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1 ),
    co1_11 ).

cnf(c_0_17,negated_conjecture,
    app(app(sk7,cons(sk6,nil)),sk8) = sk1,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    ssItem(sk6),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ssList(sk8),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    ssList(sk7),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_12]) ).

cnf(c_0_21,negated_conjecture,
    ( ssItem(sk5(X3,X2,X1))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1 ),
    co1_8 ).

cnf(c_0_22,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk1
    | ~ leq(X1,sk5(X3,X2,X1)) ),
    co1_12 ).

cnf(c_0_23,axiom,
    ( leq(X1,X2)
    | ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    clause103 ).

cnf(c_0_24,negated_conjecture,
    lt(sk6,sk5(sk8,sk7,sk6)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_25,negated_conjecture,
    ssItem(sk5(sk8,sk7,sk6)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_26,negated_conjecture,
    ~ leq(sk6,sk5(sk8,sk7,sk6)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_18])]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWC242-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.10  % 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.13/0.31  % Computer : n029.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit   : 300
% 0.13/0.31  % WCLimit    : 300
% 0.13/0.31  % DateTime   : Tue May  5 04:38:59 EDT 2026
% 0.13/0.31  % CPUTime    : 
% 0.13/0.32  % start to proof: theBenchmark
% 1.54/1.78  % Version  : CSE_E---1.7
% 1.54/1.78  % Problem  : theBenchmark.p
% 1.54/1.78  % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.78  % SZS output start CNFRefutation
% See solution above
% 1.54/1.78  % Total time : 1.368s
%------------------------------------------------------------------------------