TSTP Solution File: COM010-2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COM010-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n005.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:36:16 EDT 2023

% Result   : Unsatisfiable 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   22 (  12 unt;  10 typ;   0 def)
%            Number of atoms       :   12 (  11 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   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  :   15 (   7   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn;   0   !;   0   ?;   0   :)

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

tff(decl_23,type,
    t_a: $i ).

tff(decl_24,type,
    c_UNITY_OInit: ( $i * $i ) > $i ).

tff(decl_25,type,
    v_G: $i ).

tff(decl_26,type,
    c_UNITY_OActs: ( $i * $i ) > $i ).

tff(decl_27,type,
    c_UNITY_OAllowedActs: ( $i * $i ) > $i ).

tff(decl_28,type,
    tc_prod: ( $i * $i ) > $i ).

tff(decl_29,type,
    tc_set: $i > $i ).

tff(decl_30,type,
    c_Pair: ( $i * $i * $i * $i ) > $i ).

tff(decl_31,type,
    c_UNITY_Omk__program: ( $i * $i ) > $i ).

cnf(cls_UNITY_Osurjective__mk__program_0,axiom,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Osurjective__mk__program_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_3,negated_conjecture,
    v_F != v_G,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(c_0_5,axiom,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
    cls_UNITY_Osurjective__mk__program_0 ).

cnf(c_0_6,negated_conjecture,
    c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
    cls_conjecture_2 ).

cnf(c_0_7,negated_conjecture,
    c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
    cls_conjecture_0 ).

cnf(c_0_8,negated_conjecture,
    c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
    cls_conjecture_1 ).

cnf(c_0_9,negated_conjecture,
    v_F != v_G,
    cls_conjecture_3 ).

cnf(c_0_10,negated_conjecture,
    v_G = v_F,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : COM010-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 29 12:40:23 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.59  % Version  : CSE_E---1.5
% 0.21/0.59  % Problem  : theBenchmark.p
% 0.21/0.59  % Proof found
% 0.21/0.59  % SZS status Theorem for theBenchmark.p
% 0.21/0.59  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.004000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.006000 s
%------------------------------------------------------------------------------