↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN116-10 : TPTP v9.2.1. Released v7.5.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 : 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:11 PM UTC 2026

% Result   : Unsatisfiable 1.36s 1.76s
% Output   : CNFRefutation 1.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   40 (  40 unt;   0 nHn;   9 RR)
%            Number of literals    :   40 (  39 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   3 con; 0-4 aty)
%            Number of variables   :   63 (  28 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
    ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_085) ).

cnf(axiom_14,axiom,
    p0(b,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(rule_029,axiom,
    ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_029) ).

cnf(axiom_5,axiom,
    s0(b) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

cnf(rule_137,axiom,
    ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).

cnf(rule_176,axiom,
    ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_176) ).

cnf(rule_244,axiom,
    ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_244) ).

cnf(rule_267,axiom,
    ifeq(p2(X1,X2,X3),true,r3(X1,X3,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_267) ).

cnf(rule_299,axiom,
    ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_299) ).

cnf(rule_002,axiom,
    ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).

cnf(axiom_15,axiom,
    n0(a,b) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).

cnf(rule_300,axiom,
    ifeq(s4(X1),true,ifeq(r3(X2,X3,X3),true,k5(X3),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_300) ).

cnf(prove_this,negated_conjecture,
    k5(b) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_14,axiom,
    ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
    rule_085 ).

cnf(c_0_15,axiom,
    p0(b,X1) = true,
    axiom_14 ).

cnf(c_0_16,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_17,axiom,
    ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
    rule_029 ).

cnf(c_0_18,axiom,
    s0(b) = true,
    axiom_5 ).

cnf(c_0_19,axiom,
    ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
    rule_137 ).

cnf(c_0_20,plain,
    p1(X1,X1,X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_21,axiom,
    ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
    rule_176 ).

cnf(c_0_22,plain,
    m1(b,X1,b) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_16]),c_0_16]) ).

cnf(c_0_23,axiom,
    ifeq(n2(X1),true,p3(X1,X1,X1),true) = true,
    rule_244 ).

cnf(c_0_24,plain,
    n2(X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).

cnf(c_0_25,axiom,
    ifeq(p2(X1,X2,X3),true,r3(X1,X3,X1),true) = true,
    rule_267 ).

cnf(c_0_26,plain,
    p2(X1,b,X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]) ).

cnf(c_0_27,axiom,
    ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
    rule_299 ).

cnf(c_0_28,plain,
    p3(X1,X1,X1) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_16]) ).

cnf(c_0_29,axiom,
    ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
    rule_002 ).

cnf(c_0_30,axiom,
    n0(a,b) = true,
    axiom_15 ).

cnf(c_0_31,axiom,
    ifeq(s4(X1),true,ifeq(r3(X2,X3,X3),true,k5(X3),true),true) = true,
    rule_300 ).

cnf(c_0_32,plain,
    r3(X1,X1,X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]) ).

cnf(c_0_33,plain,
    ifeq(l1(X1,X2),true,s4(X1),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16]) ).

cnf(c_0_34,plain,
    l1(b,b) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_16]) ).

cnf(c_0_35,plain,
    ifeq(s4(X1),true,k5(X2),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_16]) ).

cnf(c_0_36,plain,
    s4(b) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).

cnf(c_0_37,negated_conjecture,
    k5(b) != true,
    prove_this ).

cnf(c_0_38,plain,
    k5(X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN116-10 : TPTP v9.2.1. Released v7.5.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.15/0.33  % Computer : n019.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:14:29 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.36/1.76  % Version  : CSE_E---1.7
% 1.36/1.76  % Problem  : theBenchmark.p
% 1.36/1.76  % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.76  % SZS output start CNFRefutation
% See solution above
% 1.36/1.76  % Total time : 1.368s
%------------------------------------------------------------------------------