↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : COL065-1 : TPTP v9.2.1. Released v1.0.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 : n026.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 04:12:14 PM UTC 2026

% Result   : Unsatisfiable 17.26s 10.52s
% Output   : CNFRefutation 17.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;  12 RR)
%            Number of literals    :   16 (  15 equ;  11 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   13 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_g_combinator,negated_conjecture,
    apply(apply(apply(apply(X1,f(X1)),g(X1)),h(X1)),i(X1)) != apply(apply(f(X1),i(X1)),apply(g(X1),h(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_g_combinator) ).

cnf(b_definition,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).

cnf(t_definition,axiom,
    apply(apply(t,X1),X2) = apply(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).

cnf(c_0_3,negated_conjecture,
    apply(apply(apply(apply(X1,f(X1)),g(X1)),h(X1)),i(X1)) != apply(apply(f(X1),i(X1)),apply(g(X1),h(X1))),
    prove_g_combinator ).

cnf(c_0_4,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    b_definition ).

cnf(c_0_5,negated_conjecture,
    apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),g(apply(apply(b,X1),X2))),h(apply(apply(b,X1),X2))),i(apply(apply(b,X1),X2))) != apply(apply(f(apply(apply(b,X1),X2)),i(apply(apply(b,X1),X2))),apply(g(apply(apply(b,X1),X2)),h(apply(apply(b,X1),X2)))),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    apply(apply(apply(X1,f(apply(apply(b,b),X1))),apply(g(apply(apply(b,b),X1)),h(apply(apply(b,b),X1)))),i(apply(apply(b,b),X1))) != apply(apply(f(apply(apply(b,b),X1)),i(apply(apply(b,b),X1))),apply(g(apply(apply(b,b),X1)),h(apply(apply(b,b),X1)))),
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    apply(apply(apply(X1,apply(X2,f(apply(apply(b,b),apply(apply(b,X1),X2))))),apply(g(apply(apply(b,b),apply(apply(b,X1),X2))),h(apply(apply(b,b),apply(apply(b,X1),X2))))),i(apply(apply(b,b),apply(apply(b,X1),X2)))) != apply(apply(f(apply(apply(b,b),apply(apply(b,X1),X2))),i(apply(apply(b,b),apply(apply(b,X1),X2)))),apply(g(apply(apply(b,b),apply(apply(b,X1),X2))),h(apply(apply(b,b),apply(apply(b,X1),X2))))),
    inference(spm,[status(thm)],[c_0_6,c_0_4]) ).

cnf(c_0_8,axiom,
    apply(apply(t,X1),X2) = apply(X2,X1),
    t_definition ).

cnf(c_0_9,negated_conjecture,
    apply(apply(apply(apply(X1,f(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))),X2),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1)))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),X1))))),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,negated_conjecture,
    apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),X3),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),i(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),i(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,b),apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))))),
    inference(spm,[status(thm)],[c_0_9,c_0_4]) ).

cnf(c_0_11,negated_conjecture,
    apply(apply(apply(X1,f(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),apply(X2,apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),i(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),h(apply(apply(b,b),apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))))),
    inference(spm,[status(thm)],[c_0_10,c_0_4]) ).

cnf(c_0_12,negated_conjecture,
    apply(apply(apply(X1,apply(g(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))))),f(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))),i(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))))),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    apply(apply(apply(X1,apply(X2,apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))))),f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,X1),X2))),apply(apply(b,b),t)))))),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_14,negated_conjecture,
    apply(apply(X1,apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))),apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))) != apply(apply(f(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),i(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t))))),apply(g(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))),h(apply(apply(b,b),apply(apply(b,apply(t,apply(apply(b,b),X1))),apply(apply(b,b),t)))))),
    inference(spm,[status(thm)],[c_0_13,c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_14,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : COL065-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.13  % 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.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May  4 16:16:53 EDT 2026
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % start to proof: theBenchmark
% 17.26/10.52  % Version  : CSE_E---1.7
% 17.26/10.52  % Problem  : theBenchmark.p
% 17.26/10.52  % SZS status Unsatisfiable for theBenchmark.p
% 17.26/10.52  % SZS output start CNFRefutation
% See solution above
% 17.26/10.55  % Total time : 8.380s
%------------------------------------------------------------------------------