TSTP Solution File: SEU444+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% 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  : 600s
% DateTime : Tue Jul 19 14:37:35 EDT 2022

% Result   : Theorem 0.18s 0.44s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   6 unt;   0 nHn;  10 RR)
%            Number of literals    :   14 (   0 equ;   8 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(14,axiom,
    m2_relset_1(skc8,skc7,skc6),
    file('SEU444+1.p',unknown),
    [] ).

cnf(46,axiom,
    ( ~ m2_relset_1(u,v,w)
    | equal(k10_relset_1(v,w,u,v),k2_funct_5(u)) ),
    file('SEU444+1.p',unknown),
    [] ).

cnf(49,axiom,
    ( ~ m2_relset_1(u,v,w)
    | equal(k10_relset_1(w,v,k6_relset_1(v,w,u),w),k1_funct_5(u)) ),
    file('SEU444+1.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),skc6),k1_funct_5(skc8))
    | ~ equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),k10_relset_1(skc7,skc6,skc8,skc7)),k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),k2_funct_5(skc8))) ),
    file('SEU444+1.p',unknown),
    [] ).

cnf(54,plain,
    equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),skc6),k1_funct_5(skc8)),
    inference(res,[status(thm),theory(equality)],[14,49]),
    [iquote('0:Res:14.0,49.0')] ).

cnf(55,plain,
    equal(k10_relset_1(skc7,skc6,skc8,skc7),k2_funct_5(skc8)),
    inference(res,[status(thm),theory(equality)],[14,46]),
    [iquote('0:Res:14.0,46.0')] ).

cnf(58,plain,
    ( ~ equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),skc6),k1_funct_5(skc8))
    | ~ equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),k2_funct_5(skc8)),k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),k2_funct_5(skc8))) ),
    inference(rew,[status(thm),theory(equality)],[55,50]),
    [iquote('0:Rew:55.0,50.1')] ).

cnf(59,plain,
    ~ equal(k10_relset_1(skc6,skc7,k6_relset_1(skc7,skc6,skc8),skc6),k1_funct_5(skc8)),
    inference(obv,[status(thm),theory(equality)],[58]),
    [iquote('0:Obv:58.1')] ).

cnf(60,plain,
    ~ equal(k1_funct_5(skc8),k1_funct_5(skc8)),
    inference(rew,[status(thm),theory(equality)],[54,59]),
    [iquote('0:Rew:54.0,59.0')] ).

cnf(61,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[60]),
    [iquote('0:Obv:60.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 11:01:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 55 clauses.
% 0.18/0.44  SPASS allocated 97730 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.10 on the problem.
% 0.18/0.44  		0:00:00.04 for the input.
% 0.18/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.00 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 1, length 10 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : t56_relset_2 t51_relset_2
% 0.18/0.44  
%------------------------------------------------------------------------------