TSTP Solution File: COL032-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COL032-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n023.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 : Wed Aug 30 18:22:09 EDT 2023

% Result   : Unsatisfiable 0.50s 0.58s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   14 (  10 unt;   4 typ;   0 def)
%            Number of atoms       :   10 (   9 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    m: $i ).

tff(decl_23,type,
    apply: ( $i * $i ) > $i ).

tff(decl_24,type,
    q: $i ).

tff(decl_25,type,
    f: $i > $i ).

cnf(prove_fixed_point,negated_conjecture,
    apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).

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

cnf(m_definition,axiom,
    apply(m,X1) = apply(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_definition) ).

cnf(c_0_3,negated_conjecture,
    apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
    prove_fixed_point ).

cnf(c_0_4,axiom,
    apply(apply(apply(q,X1),X2),X3) = apply(X2,apply(X1,X3)),
    q_definition ).

cnf(c_0_5,axiom,
    apply(m,X1) = apply(X1,X1),
    m_definition ).

cnf(c_0_6,negated_conjecture,
    apply(f(apply(apply(q,X1),X2)),apply(X2,apply(X1,f(apply(apply(q,X1),X2))))) != apply(X2,apply(X1,f(apply(apply(q,X1),X2)))),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,plain,
    apply(X1,apply(X2,apply(apply(q,X2),X1))) = apply(m,apply(apply(q,X2),X1)),
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    apply(m,apply(apply(q,X1),f(apply(apply(q,apply(q,X1)),X1)))) != apply(X1,apply(apply(q,X1),f(apply(apply(q,apply(q,X1)),X1)))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(er,[status(thm)],[c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : COL032-1 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.11  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.09/0.31  % Computer : n023.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Sun Aug 27 05:09:41 EDT 2023
% 0.09/0.31  % CPUTime  : 
% 0.16/0.56  start to proof: theBenchmark
% 0.50/0.58  % Version  : CSE_E---1.5
% 0.50/0.58  % Problem  : theBenchmark.p
% 0.50/0.58  % Proof found
% 0.50/0.58  % SZS status Theorem for theBenchmark.p
% 0.50/0.58  % SZS output start Proof
% See solution above
% 0.50/0.58  % Total time : 0.008000 s
% 0.50/0.58  % SZS output end Proof
% 0.50/0.58  % Total time : 0.011000 s
%------------------------------------------------------------------------------