↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.38s 1.73s
% Output   : CNFRefutation 1.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   46 (  27 unt;   0 nHn;  40 RR)
%            Number of literals    :   79 (   0 equ;  36 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    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   42 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_024,axiom,
    ( m1(X1,a,X2)
    | ~ m0(a,X3,a)
    | ~ q0(X1,X2)
    | ~ m1(X2,c,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_024) ).

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

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

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

cnf(rule_035,axiom,
    ( m1(X1,X2,X1)
    | ~ r0(X1)
    | ~ l0(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_035) ).

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

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

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

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

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

cnf(rule_127,axiom,
    ( k2(X1,X2)
    | ~ m1(X3,X2,X1)
    | ~ k1(X4)
    | ~ k2(X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).

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

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

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

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

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

cnf(c_0_16,axiom,
    ( m1(X1,a,X2)
    | ~ m0(a,X3,a)
    | ~ q0(X1,X2)
    | ~ m1(X2,c,X2) ),
    rule_024 ).

cnf(c_0_17,axiom,
    m0(a,X1,a),
    axiom_12 ).

cnf(c_0_18,axiom,
    ( m1(c,c,c)
    | ~ l0(c) ),
    rule_020 ).

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

cnf(c_0_20,axiom,
    ( m1(X1,X2,X1)
    | ~ r0(X1)
    | ~ l0(X2) ),
    rule_035 ).

cnf(c_0_21,axiom,
    l0(a),
    axiom_20 ).

cnf(c_0_22,plain,
    ( m1(X1,a,X2)
    | ~ m1(X2,c,X2)
    | ~ q0(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_23,plain,
    m1(c,c,c),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_24,plain,
    ( m1(X1,a,X1)
    | ~ r0(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

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

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

cnf(c_0_28,plain,
    ( m1(X1,a,c)
    | ~ q0(X1,c) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,axiom,
    q0(d,c),
    axiom_33 ).

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

cnf(c_0_31,plain,
    m1(b,a,b),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

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

cnf(c_0_33,plain,
    q1(e,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]) ).

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

cnf(c_0_35,axiom,
    n0(b,a),
    axiom_37 ).

cnf(c_0_36,plain,
    m1(d,a,c),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_37,negated_conjecture,
    ~ k2(c,a),
    prove_this ).

cnf(c_0_38,plain,
    ( k2(b,a)
    | ~ k2(X1,a)
    | ~ k1(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_39,plain,
    k2(X1,X1),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,plain,
    k1(a),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,axiom,
    n0(a,b),
    axiom_15 ).

cnf(c_0_42,plain,
    ( ~ k2(X1,a)
    | ~ k1(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_37]) ).

cnf(c_0_43,plain,
    k2(b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).

cnf(c_0_44,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_34,c_0_41]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN110-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:14:06 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.38/1.73  % Version  : CSE_E---1.7
% 1.38/1.73  % Problem  : theBenchmark.p
% 1.38/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.73  % SZS output start CNFRefutation
% See solution above
% 1.38/1.73  % Total time : 1.374s
%------------------------------------------------------------------------------