↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.41s 1.75s
% Output   : CNFRefutation 1.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   45 (  21 unt;   0 nHn;  37 RR)
%            Number of literals    :   88 (   0 equ;  45 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   :   65 (  25 sgn)

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

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

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

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(rule_126,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).

cnf(axiom_36,axiom,
    q0(a,b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).

cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(rule_190,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_190) ).

cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

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

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

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

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

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

cnf(c_0_17,plain,
    ( l1(d,X1)
    | ~ p0(X2,d)
    | ~ r0(X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_19,axiom,
    ( n1(X1,X1,X2)
    | ~ m0(X3,X4,X4)
    | ~ m0(X2,X3,X1) ),
    rule_059 ).

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

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

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

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

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

cnf(c_0_25,axiom,
    q0(a,b),
    axiom_36 ).

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

cnf(c_0_27,plain,
    ( n1(X1,X1,X2)
    | ~ m0(X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_28,plain,
    ( q3(X1,X2)
    | ~ l1(X2,X1)
    | ~ n0(X1,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_29,plain,
    l1(d,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_30,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    rule_190 ).

cnf(c_0_31,axiom,
    s0(d),
    axiom_1 ).

cnf(c_0_32,plain,
    ( s1(a)
    | ~ s1(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_33,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_26,c_0_18]) ).

cnf(c_0_34,axiom,
    ( q3(X1,X2)
    | ~ n1(X3,X1,X2)
    | ~ s2(X1)
    | ~ q3(X2,X1) ),
    rule_257 ).

cnf(c_0_35,plain,
    n1(X1,X1,X2),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_36,plain,
    ( q3(X1,d)
    | ~ n0(X1,X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

cnf(c_0_38,plain,
    ( s2(d)
    | ~ s1(a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).

cnf(c_0_39,plain,
    s1(a),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,plain,
    ( q3(X1,X2)
    | ~ q3(X2,X1)
    | ~ s2(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,plain,
    q3(e,d),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    s2(d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).

cnf(c_0_43,negated_conjecture,
    ~ q3(d,X1),
    prove_this ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN179-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 : n010.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:18:21 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.41/1.75  % Version  : CSE_E---1.7
% 1.41/1.75  % Problem  : theBenchmark.p
% 1.41/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.41/1.75  % SZS output start CNFRefutation
% See solution above
% 1.41/1.75  % Total time : 1.372s
%------------------------------------------------------------------------------