↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN141-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n019.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:15 PM UTC 2026

% Result   : Unsatisfiable 1.43s 1.75s
% Output   : CNFRefutation 1.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   41 (  21 unt;   0 nHn;  38 RR)
%            Number of literals    :   75 (   0 equ;  39 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    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   40 (  13 sgn)

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

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

cnf(rule_274,axiom,
    ( k4(c)
    | ~ n0(c,d)
    | ~ q3(e,b)
    | ~ n3(e) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_274) ).

cnf(axiom_34,axiom,
    n0(c,d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).

cnf(prove_this,negated_conjecture,
    ~ m5(c,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_304,axiom,
    ( m5(X1,X1)
    | ~ k4(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_304) ).

cnf(rule_154,axiom,
    ( p2(X1,X1,X1)
    | ~ q1(X1,X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_154) ).

cnf(rule_003,axiom,
    ( l1(X1,X2)
    | ~ p0(X3,X1)
    | ~ r0(X4)
    | ~ m0(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_003) ).

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

cnf(axiom_18,axiom,
    p0(c,b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_18) ).

cnf(rule_240,axiom,
    ( n3(X1)
    | ~ p2(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_240) ).

cnf(rule_255,axiom,
    ( q3(X1,X2)
    | ~ q2(X3,X1,X2)
    | ~ n0(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_255) ).

cnf(rule_186,axiom,
    ( q2(X1,X1,X2)
    | ~ l1(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_186) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

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

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

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

cnf(c_0_17,axiom,
    ( k4(c)
    | ~ n0(c,d)
    | ~ q3(e,b)
    | ~ n3(e) ),
    rule_274 ).

cnf(c_0_18,axiom,
    n0(c,d),
    axiom_34 ).

cnf(c_0_19,negated_conjecture,
    ~ m5(c,X1),
    prove_this ).

cnf(c_0_20,axiom,
    ( m5(X1,X1)
    | ~ k4(X1) ),
    rule_304 ).

cnf(c_0_21,axiom,
    ( p2(X1,X1,X1)
    | ~ q1(X1,X1,X1) ),
    rule_154 ).

cnf(c_0_22,plain,
    q1(e,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).

cnf(c_0_23,axiom,
    ( l1(X1,X2)
    | ~ p0(X3,X1)
    | ~ r0(X4)
    | ~ m0(X2,X1,X3) ),
    rule_003 ).

cnf(c_0_24,axiom,
    m0(e,b,c),
    axiom_27 ).

cnf(c_0_25,axiom,
    p0(c,b),
    axiom_18 ).

cnf(c_0_26,plain,
    ( k4(c)
    | ~ q3(e,b)
    | ~ n3(e) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_27,negated_conjecture,
    ~ k4(c),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,axiom,
    ( n3(X1)
    | ~ p2(X2,X3,X1) ),
    rule_240 ).

cnf(c_0_29,plain,
    p2(e,e,e),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,axiom,
    ( q3(X1,X2)
    | ~ q2(X3,X1,X2)
    | ~ n0(X3,X1) ),
    rule_255 ).

cnf(c_0_31,axiom,
    ( q2(X1,X1,X2)
    | ~ l1(X2,X1) ),
    rule_186 ).

cnf(c_0_32,plain,
    ( l1(b,e)
    | ~ r0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_33,axiom,
    r0(b),
    axiom_9 ).

cnf(c_0_34,plain,
    ( ~ q3(e,b)
    | ~ n3(e) ),
    inference(sr,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,plain,
    n3(e),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    ( q3(X1,X2)
    | ~ l1(X2,X1)
    | ~ n0(X1,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,plain,
    l1(b,e),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

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

cnf(c_0_39,plain,
    ~ q3(e,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

cnf(c_0_40,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN141-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n019.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 08:15:29 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.43/1.75  % Version  : CSE_E---1.7
% 1.43/1.75  % Problem  : theBenchmark.p
% 1.43/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.43/1.75  % SZS output start CNFRefutation
% See solution above
% 1.43/1.75  % Total time : 1.373s
%------------------------------------------------------------------------------