↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.42s 1.79s
% Output   : CNFRefutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   31 (  17 unt;   0 nHn;  25 RR)
%            Number of literals    :   57 (   0 equ;  28 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   40 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).

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

cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(rule_133,axiom,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ s1(X3)
    | ~ m0(X4,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).

cnf(axiom_31,axiom,
    m0(b,b,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_31) ).

cnf(rule_183,axiom,
    ( q2(X1,c,X2)
    | ~ k1(X2)
    | ~ l0(c)
    | ~ l2(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_183) ).

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

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(prove_this,negated_conjecture,
    ~ q2(e,c,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_11,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    rule_126 ).

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

cnf(c_0_13,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    rule_125 ).

cnf(c_0_14,axiom,
    p0(b,X1),
    axiom_14 ).

cnf(c_0_15,plain,
    ( s1(X1)
    | ~ s1(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ s1(X3)
    | ~ m0(X4,X3,X1) ),
    rule_133 ).

cnf(c_0_18,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ m0(X3,X4,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_20,axiom,
    m0(b,b,e),
    axiom_31 ).

cnf(c_0_21,axiom,
    ( q2(X1,c,X2)
    | ~ k1(X2)
    | ~ l0(c)
    | ~ l2(X2,X1) ),
    rule_183 ).

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

cnf(c_0_23,plain,
    ( l2(e,e)
    | ~ p0(X1,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

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

cnf(c_0_26,plain,
    ( q2(X1,c,X2)
    | ~ l2(X2,X1)
    | ~ k1(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_27,plain,
    l2(e,e),
    inference(spm,[status(thm)],[c_0_23,c_0_14]) ).

cnf(c_0_28,plain,
    k1(e),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ~ q2(e,c,X1),
    prove_this ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN176-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.15/0.33  % Computer : n010.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 08:16:36 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.42/1.79  % Version  : CSE_E---1.7
% 1.42/1.79  % Problem  : theBenchmark.p
% 1.42/1.79  % SZS status Unsatisfiable for theBenchmark.p
% 1.42/1.79  % SZS output start CNFRefutation
% See solution above
% 1.42/1.79  % Total time : 1.420s
%------------------------------------------------------------------------------