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

View Problem - Process Solution

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

% Computer : n008.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:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(14,axiom,
    m1_subset_1(skc13,k1_zfmisc_1(skc12)),
    file('SEU435+1.p',unknown),
    [] ).

cnf(30,axiom,
    m1_subset_1(skc11,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(skc9,skc10)))),
    file('SEU435+1.p',unknown),
    [] ).

cnf(47,axiom,
    ~ m1_subset_1(a_6_0_relset_2(skc9,skc10,skc11,skc12,skc14,skc13),k1_zfmisc_1(k1_zfmisc_1(skc14))),
    file('SEU435+1.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ m1_subset_1(u,k1_zfmisc_1(v))
    | ~ m1_subset_1(w,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(x,y))))
    | m1_subset_1(a_6_0_relset_2(x,y,w,v,z,u),k1_zfmisc_1(k1_zfmisc_1(z))) ),
    file('SEU435+1.p',unknown),
    [] ).

cnf(98,plain,
    ( ~ m1_subset_1(skc11,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(skc9,skc10))))
    | ~ m1_subset_1(skc13,k1_zfmisc_1(skc12)) ),
    inference(res,[status(thm),theory(equality)],[61,47]),
    [iquote('0:Res:61.2,47.0')] ).

cnf(105,plain,
    $false,
    inference(mrr,[status(thm)],[98,30,14]),
    [iquote('0:MRR:98.0,98.1,30.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU435+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n008.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  : 600
% 0.14/0.34  % DateTime : Sun Jun 19 21:51:07 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  
% 0.21/0.47  SPASS V 3.9 
% 0.21/0.47  SPASS beiseite: Proof found.
% 0.21/0.47  % SZS status Theorem
% 0.21/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.47  SPASS derived 27 clauses, backtracked 0 clauses, performed 0 splits and kept 77 clauses.
% 0.21/0.47  SPASS allocated 97957 KBytes.
% 0.21/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.21/0.47  		0:00:00.04 for the input.
% 0.21/0.47  		0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.47  		0:00:00.00 for inferences.
% 0.21/0.47  		0:00:00.00 for the backtracking.
% 0.21/0.47  		0:00:00.00 for the reduction.
% 0.21/0.47  
% 0.21/0.47  
% 0.21/0.47  Here is a proof with depth 1, length 6 :
% 0.21/0.47  % SZS output start Refutation
% See solution above
% 0.21/0.47  Formulae used in the proof : t36_relset_2 s8_domain_1__e1_46__relset_2
% 0.21/0.47  
%------------------------------------------------------------------------------