↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.31s 1.73s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   37 (  18 unt;   0 nHn;  37 RR)
%            Number of literals    :   68 (  23 equ;  37 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

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

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

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

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

cnf(co1_13,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

cnf(co1_10,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

cnf(co1_11,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_12,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

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(c_0_13,negated_conjecture,
    neq(sk2,nil),
    co1_7 ).

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

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

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

cnf(c_0_17,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk3
    | ~ neq(sk4,nil) ),
    co1_13 ).

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

cnf(c_0_19,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    co1_10 ).

cnf(c_0_20,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    co1_11 ).

cnf(c_0_21,negated_conjecture,
    ( app(app(X1,cons(X2,nil)),X3) != sk3
    | app(app(X3,cons(X2,nil)),X1) != sk4
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    app(sk6,cons(sk5,nil)) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_23,negated_conjecture,
    ssItem(sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).

cnf(c_0_24,negated_conjecture,
    ssList(sk6),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18])]) ).

cnf(c_0_25,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk4
    | ~ neq(sk4,nil) ),
    co1_12 ).

cnf(c_0_26,negated_conjecture,
    ( app(app(X1,cons(sk5,nil)),sk6) != sk4
    | app(sk3,X1) != sk3
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

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

cnf(c_0_28,negated_conjecture,
    app(cons(sk5,nil),sk6) = sk4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_18])]) ).

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

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

cnf(c_0_31,negated_conjecture,
    ( app(sk3,nil) != sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).

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

cnf(c_0_33,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_30,c_0_16]) ).

cnf(c_0_34,negated_conjecture,
    ~ ssList(cons(sk5,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC419-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 : n013.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:49:11 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.31/1.73  % Version  : CSE_E---1.7
% 1.31/1.73  % Problem  : theBenchmark.p
% 1.31/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.73  % SZS output start CNFRefutation
% See solution above
% 1.31/1.73  % Total time : 1.372s
%------------------------------------------------------------------------------