↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.37s 1.78s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  15 unt;   0 nHn;  23 RR)
%            Number of literals    :   47 (   0 equ;  23 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   30 (  10 sgn)

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

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

cnf(axiom_24,axiom,
    l0(c),
    file('/export/starexec/sandbox/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/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_127,axiom,
    ( k2(X1,X2)
    | ~ m1(X3,X2,X1)
    | ~ k1(X4)
    | ~ k2(X4,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_127) ).

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

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

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

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

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

cnf(c_0_11,axiom,
    k0(b),
    axiom_32 ).

cnf(c_0_12,plain,
    ( m1(X1,b,X1)
    | ~ l0(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

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

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

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

cnf(c_0_17,plain,
    m1(c,b,c),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ k2(c,b),
    prove_this ).

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

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

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

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

cnf(c_0_23,plain,
    ( ~ k2(X1,b)
    | ~ k1(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_24,plain,
    k2(X1,X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN111-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.15/0.33  % Computer : n017.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:12:43 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.37/1.78  % Version  : CSE_E---1.7
% 1.37/1.78  % Problem  : theBenchmark.p
% 1.37/1.78  % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.78  % SZS output start CNFRefutation
% See solution above
% 1.37/1.79  % Total time : 1.422s
%------------------------------------------------------------------------------