↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.74s 1.86s
% Output   : CNFRefutation 1.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (  11 unt;   0 nHn;   7 RR)
%            Number of literals    :   19 (  18 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(abstraction,axiom,
    apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',abstraction) ).

cnf(k_definition,axiom,
    apply(k(X1),X2) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',k_definition) ).

cnf(extensionality2,axiom,
    ( X1 = X2
    | apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/COL001-0.ax',extensionality2) ).

cnf(prove_TRC2b,negated_conjecture,
    k(b) != apply(abstraction,apply(abstraction,k(b))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_TRC2b) ).

cnf(c_0_4,axiom,
    apply(apply(apply(abstraction,X1),X2),X3) = apply(apply(X1,k(X3)),apply(X2,X3)),
    abstraction ).

cnf(c_0_5,axiom,
    apply(k(X1),X2) = X1,
    k_definition ).

cnf(c_0_6,plain,
    apply(apply(apply(abstraction,k(X1)),X2),X3) = apply(X1,apply(X2,X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    ( X1 = X2
    | apply(X1,n(X1,X2)) != apply(X2,n(X1,X2)) ),
    extensionality2 ).

cnf(c_0_8,plain,
    apply(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3) = apply(X1,X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_5]) ).

cnf(c_0_9,plain,
    ( apply(apply(abstraction,apply(abstraction,k(X1))),X2) = X3
    | apply(X1,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)) != apply(X3,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    ( k(X1) = X2
    | apply(X2,n(k(X1),X2)) != X1 ),
    inference(spm,[status(thm)],[c_0_7,c_0_5]) ).

cnf(c_0_11,plain,
    apply(apply(abstraction,apply(abstraction,k(X1))),X2) = X1,
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    k(b) != apply(abstraction,apply(abstraction,k(b))),
    prove_TRC2b ).

cnf(c_0_13,plain,
    apply(abstraction,apply(abstraction,k(X1))) = k(X1),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : COL080-1 : TPTP v9.2.1. Released v1.2.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 : 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   : Mon May  4 16:16:06 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.74/1.86  % Version  : CSE_E---1.7
% 1.74/1.86  % Problem  : theBenchmark.p
% 1.74/1.86  % SZS status Unsatisfiable for theBenchmark.p
% 1.74/1.86  % SZS output start CNFRefutation
% See solution above
% 1.74/1.87  % Total time : 1.367s
%------------------------------------------------------------------------------