↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWX190-1 : TPTP v9.3.0. Released v9.3.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 : n027.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:34:40 PM UTC 2026

% Result   : Unsatisfiable 1.35s 1.74s
% Output   : CNFRefutation 1.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;   7 RR)
%            Number of literals    :   23 (  22 equ;   6 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    eq3(prop4(X1),bfalse) != btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(axiom_063,axiom,
    prop4(X1) = eq2(opt(d(X1)),opt(d(opt(X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_063) ).

cnf(axiom_052,axiom,
    opt(x(n(z),X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_052) ).

cnf(axiom_044,axiom,
    d(x(X1,X2)) = x(d(X1),d(X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_044) ).

cnf(axiom_043,axiom,
    d(n(X1)) = n(z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).

cnf(axiom_019,axiom,
    fail32(n(X1),n(X2)) = n(mulNat(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).

cnf(axiom_074,axiom,
    eq2(x(X1,X2),n(X3)) = bfalse,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_074) ).

cnf(axiom_088,axiom,
    eq3(X1,X1) = btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_088) ).

cnf(c_0_8,negated_conjecture,
    eq3(prop4(X1),bfalse) != btrue,
    goal ).

cnf(c_0_9,axiom,
    prop4(X1) = eq2(opt(d(X1)),opt(d(opt(X1)))),
    axiom_063 ).

cnf(c_0_10,negated_conjecture,
    eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse) != btrue,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    opt(x(n(z),X1)) = X1,
    axiom_052 ).

cnf(c_0_12,axiom,
    d(x(X1,X2)) = x(d(X1),d(X2)),
    axiom_044 ).

cnf(c_0_13,axiom,
    d(n(X1)) = n(z),
    axiom_043 ).

cnf(c_0_14,negated_conjecture,
    eq3(eq2(opt(d(x(n(z),X1))),opt(d(X1))),bfalse) != btrue,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    d(x(n(X1),X2)) = x(n(z),d(X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    eq3(eq2(d(X1),opt(d(X1))),bfalse) != btrue,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).

cnf(c_0_17,axiom,
    fail32(n(X1),n(X2)) = n(mulNat(X1,X2)),
    axiom_019 ).

cnf(c_0_18,negated_conjecture,
    eq3(eq2(x(n(z),d(X1)),d(X1)),bfalse) != btrue,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_11]) ).

cnf(c_0_19,plain,
    d(fail32(n(X1),n(X2))) = n(z),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_20,axiom,
    eq2(x(X1,X2),n(X3)) = bfalse,
    axiom_074 ).

cnf(c_0_21,axiom,
    eq3(X1,X1) = btrue,
    axiom_088 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWX190-1 : TPTP v9.3.0. Released v9.3.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.14/0.33  % Computer : n027.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 07:54:34 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.35/1.74  % Version  : CSE_E---1.7
% 1.35/1.74  % Problem  : theBenchmark.p
% 1.35/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.74  % SZS output start CNFRefutation
% See solution above
% 1.35/1.74  % Total time : 1.368s
%------------------------------------------------------------------------------