↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.39s 1.74s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   28 (  15 unt;   0 nHn;  15 RR)
%            Number of literals    :   53 (   0 equ;  27 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   42 (  22 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(rule_131,axiom,
    ( l2(X1,X2)
    | ~ s1(X1)
    | ~ n0(e,X2)
    | ~ l2(X2,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_131) ).

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

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

cnf(prove_this,negated_conjecture,
    ~ l2(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

cnf(c_0_13,plain,
    ( s1(X1)
    | ~ s1(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

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

cnf(c_0_17,axiom,
    ( l2(X1,X2)
    | ~ s1(X1)
    | ~ n0(e,X2)
    | ~ l2(X2,X2) ),
    rule_131 ).

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

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

cnf(c_0_20,plain,
    ( l2(X1,X2)
    | ~ l2(X2,X2)
    | ~ n0(e,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).

cnf(c_0_21,axiom,
    n0(e,b),
    axiom_11 ).

cnf(c_0_22,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( l2(X1,b)
    | ~ l2(b,b) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,plain,
    l2(X1,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_12]) ).

cnf(c_0_25,negated_conjecture,
    ~ l2(a,b),
    prove_this ).

cnf(c_0_26,plain,
    l2(X1,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN121-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 : n022.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:36 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.39/1.74  % Version  : CSE_E---1.7
% 1.39/1.74  % Problem  : theBenchmark.p
% 1.39/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.74  % SZS output start CNFRefutation
% See solution above
% 1.39/1.74  % Total time : 1.373s
%------------------------------------------------------------------------------