↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.28s 1.73s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  11 unt;   1 nHn;  23 RR)
%            Number of literals    :   43 (   4 equ;  22 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    3 (   0 sgn)

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

cnf(co1_14,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ rearsegP(sk2,X1)
    | ~ rearsegP(sk1,X1)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

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

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

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

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

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

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

cnf(c_0_8,negated_conjecture,
    neq(sk2,nil),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ rearsegP(sk2,X1)
    | ~ rearsegP(sk1,X1)
    | ~ neq(sk4,nil) ),
    co1_14 ).

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

cnf(c_0_11,negated_conjecture,
    neq(sk2,nil),
    c_0_8 ).

cnf(c_0_12,negated_conjecture,
    ( rearsegP(sk3,sk5)
    | ~ neq(sk4,nil) ),
    co1_18 ).

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

cnf(c_0_14,negated_conjecture,
    ( neq(sk5,nil)
    | ~ neq(sk4,nil) ),
    co1_16 ).

cnf(c_0_15,negated_conjecture,
    ( rearsegP(sk4,sk5)
    | ~ neq(sk4,nil) ),
    co1_17 ).

cnf(c_0_16,negated_conjecture,
    ( ssList(sk5)
    | ~ neq(sk4,nil) ),
    co1_15 ).

cnf(c_0_17,negated_conjecture,
    ( ~ neq(X1,nil)
    | ~ rearsegP(sk1,X1)
    | ~ rearsegP(sk2,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_18,negated_conjecture,
    rearsegP(sk1,sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_10]),c_0_11])]) ).

cnf(c_0_19,negated_conjecture,
    neq(sk5,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_11])]) ).

cnf(c_0_20,negated_conjecture,
    rearsegP(sk2,sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10]),c_0_10]),c_0_11])]) ).

cnf(c_0_21,negated_conjecture,
    ssList(sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10]),c_0_11])]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC050-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 : n007.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:18:09 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.28/1.73  % Version  : CSE_E---1.7
% 1.28/1.73  % Problem  : theBenchmark.p
% 1.28/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73  % SZS output start CNFRefutation
% See solution above
% 1.28/1.73  % Total time : 1.375s
%------------------------------------------------------------------------------