↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.42s 1.74s
% Output   : CNFRefutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   47 (  21 unt;   0 nHn;  34 RR)
%            Number of literals    :   92 (   0 equ;  49 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   69 (  27 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
    ( p1(X1,X1,X1)
    | ~ p0(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).

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

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(rule_181,axiom,
    ( q2(X1,X1,X1)
    | ~ p1(X1,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).

cnf(rule_273,axiom,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).

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_19,axiom,
    m0(X1,d,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).

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

cnf(rule_189,axiom,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_189) ).

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_7,axiom,
    n0(d,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).

cnf(c_0_15,axiom,
    ( p1(X1,X1,X1)
    | ~ p0(X2,X1) ),
    rule_085 ).

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

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

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

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

cnf(c_0_20,axiom,
    ( q2(X1,X1,X1)
    | ~ p1(X1,X1,X1) ),
    rule_181 ).

cnf(c_0_21,plain,
    p1(X1,X1,X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,plain,
    ( s1(X1)
    | ~ s1(X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_24,axiom,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    rule_273 ).

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

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

cnf(c_0_27,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,plain,
    ( s3(X1,X2)
    | ~ s2(X1)
    | ~ m0(X1,X3,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

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

cnf(c_0_30,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ m0(X3,X4,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

cnf(c_0_31,negated_conjecture,
    ~ s3(c,c),
    prove_this ).

cnf(c_0_32,plain,
    ( s3(X1,X2)
    | ~ s2(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,axiom,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    rule_189 ).

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

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

cnf(c_0_36,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_29]) ).

cnf(c_0_37,negated_conjecture,
    ~ s2(c),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,plain,
    ( s2(X1)
    | ~ q2(b,X1,b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_23])]) ).

cnf(c_0_39,plain,
    ( q2(X1,c,X2)
    | ~ l2(X2,X1)
    | ~ k1(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

cnf(c_0_40,plain,
    l2(X1,X1),
    inference(spm,[status(thm)],[c_0_36,c_0_16]) ).

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

cnf(c_0_42,axiom,
    n0(d,b),
    axiom_7 ).

cnf(c_0_43,negated_conjecture,
    ~ q2(b,c,b),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,plain,
    ( q2(X1,c,X1)
    | ~ k1(X1) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYN207-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.11  % 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.32  % Computer : n015.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 08:20:02 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % 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.372s
%------------------------------------------------------------------------------