↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN138-1 : TPTP v9.2.1. Released v1.1.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:36:14 PM UTC 2026

% Result   : Unsatisfiable 1.42s 1.74s
% Output   : CNFRefutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   46 (  22 unt;   0 nHn;  39 RR)
%            Number of literals    :   90 (   0 equ;  46 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   14 (  13 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   48 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

cnf(axiom_24,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).

cnf(rule_107,axiom,
    ( q1(e,X1,X1)
    | ~ m0(X1,d,X1)
    | ~ m0(e,d,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).

cnf(axiom_19,axiom,
    m0(X1,d,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).

cnf(rule_127,axiom,
    ( k2(X1,X2)
    | ~ m1(X3,X2,X1)
    | ~ k1(X4)
    | ~ k2(X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).

cnf(rule_129,axiom,
    ( k2(X1,X1)
    | ~ q1(X2,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).

cnf(rule_001,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).

cnf(rule_124,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).

cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

cnf(rule_117,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_117) ).

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

cnf(rule_231,axiom,
    ( m3(X1,X2,X1)
    | ~ r2(X1)
    | ~ k2(c,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_231) ).

cnf(rule_188,axiom,
    ( r2(X1)
    | ~ r1(X1)
    | ~ l0(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_188) ).

cnf(prove_this,negated_conjecture,
    ~ m3(c,e,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_16,axiom,
    ( m1(X1,X2,X1)
    | ~ l0(X1)
    | ~ k0(X2) ),
    rule_021 ).

cnf(c_0_17,axiom,
    k0(e),
    axiom_28 ).

cnf(c_0_18,plain,
    ( m1(X1,e,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,axiom,
    l0(c),
    axiom_24 ).

cnf(c_0_20,axiom,
    ( q1(e,X1,X1)
    | ~ m0(X1,d,X1)
    | ~ m0(e,d,X1) ),
    rule_107 ).

cnf(c_0_21,axiom,
    m0(X1,d,X2),
    axiom_19 ).

cnf(c_0_22,axiom,
    ( k2(X1,X2)
    | ~ m1(X3,X2,X1)
    | ~ k1(X4)
    | ~ k2(X4,X2) ),
    rule_127 ).

cnf(c_0_23,plain,
    m1(c,e,c),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,axiom,
    ( k2(X1,X1)
    | ~ q1(X2,X1,X1) ),
    rule_129 ).

cnf(c_0_25,plain,
    q1(e,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21])]) ).

cnf(c_0_26,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    rule_001 ).

cnf(c_0_27,axiom,
    n0(e,e),
    axiom_30 ).

cnf(c_0_28,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    rule_124 ).

cnf(c_0_29,axiom,
    s0(d),
    axiom_1 ).

cnf(c_0_30,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    rule_117 ).

cnf(c_0_31,plain,
    ( k2(c,e)
    | ~ k2(X1,e)
    | ~ k1(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_32,plain,
    k2(X1,X1),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_33,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,plain,
    ( r1(X1)
    | ~ q1(d,X2,d)
    | ~ q0(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_35,plain,
    q1(d,d,d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29]),c_0_17])]) ).

cnf(c_0_36,axiom,
    q0(X1,d),
    axiom_17 ).

cnf(c_0_37,axiom,
    ( m3(X1,X2,X1)
    | ~ r2(X1)
    | ~ k2(c,X2) ),
    rule_231 ).

cnf(c_0_38,plain,
    k2(c,e),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

cnf(c_0_39,axiom,
    ( r2(X1)
    | ~ r1(X1)
    | ~ l0(X1) ),
    rule_188 ).

cnf(c_0_40,plain,
    r1(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_41,plain,
    ( m3(X1,e,X1)
    | ~ r2(X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ( r2(X1)
    | ~ l0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_43,negated_conjecture,
    ~ m3(c,e,c),
    prove_this ).

cnf(c_0_44,plain,
    ( m3(X1,e,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN138-1 : TPTP v9.2.1. Released v1.1.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.14/0.33  % Computer : n013.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue May  5 08:15:11 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.42/1.74  % Version  : CSE_E---1.7
% 1.42/1.74  % Problem  : theBenchmark.p
% 1.42/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.42/1.74  % SZS output start CNFRefutation
% See solution above
% 1.42/1.74  % Total time : 1.375s
%------------------------------------------------------------------------------