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

View Problem - Process Solution

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

% Computer : n018.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:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(11,axiom,
    ~ v1_xboole_0(skc7),
    file('SEU429+1.p',unknown),
    [] ).

cnf(15,axiom,
    m2_relset_1(skc10,skc7,skc9),
    file('SEU429+1.p',unknown),
    [] ).

cnf(23,axiom,
    m1_subset_1(skc8,k1_zfmisc_1(k1_zfmisc_1(skc7))),
    file('SEU429+1.p',unknown),
    [] ).

cnf(47,axiom,
    ~ m1_subset_1(a_4_1_relset_2(skc7,skc9,skc8,skc10),k1_zfmisc_1(k1_zfmisc_1(skc9))),
    file('SEU429+1.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ m1_subset_1(u,k1_zfmisc_1(k1_zfmisc_1(v)))
    | ~ m2_relset_1(w,v,x)
    | v1_xboole_0(v)
    | m1_subset_1(a_4_1_relset_2(v,x,u,w),k1_zfmisc_1(k1_zfmisc_1(x))) ),
    file('SEU429+1.p',unknown),
    [] ).

cnf(99,plain,
    ( ~ m2_relset_1(skc10,skc7,skc9)
    | ~ m1_subset_1(skc8,k1_zfmisc_1(k1_zfmisc_1(skc7)))
    | v1_xboole_0(skc7) ),
    inference(res,[status(thm),theory(equality)],[61,47]),
    [iquote('0:Res:61.2,47.0')] ).

cnf(105,plain,
    $false,
    inference(mrr,[status(thm)],[99,15,23,11]),
    [iquote('0:MRR:99.0,99.1,99.2,15.0,23.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SEU429+1 : TPTP v8.1.0. Released v3.4.0.
% 0.14/0.14  % Command  : run_spass %d %s
% 0.15/0.35  % Computer : n018.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Mon Jun 20 10:33:50 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.22/0.47  
% 0.22/0.47  SPASS V 3.9 
% 0.22/0.47  SPASS beiseite: Proof found.
% 0.22/0.47  % SZS status Theorem
% 0.22/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.47  SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 80 clauses.
% 0.22/0.47  SPASS allocated 97989 KBytes.
% 0.22/0.47  SPASS spent	0:00:00.10 on the problem.
% 0.22/0.47  		0:00:00.04 for the input.
% 0.22/0.47  		0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.47  		0:00:00.00 for inferences.
% 0.22/0.47  		0:00:00.00 for the backtracking.
% 0.22/0.47  		0:00:00.00 for the reduction.
% 0.22/0.47  
% 0.22/0.47  
% 0.22/0.47  Here is a proof with depth 1, length 7 :
% 0.22/0.47  % SZS output start Refutation
% See solution above
% 0.22/0.47  Formulae used in the proof : t28_relset_2 s8_domain_1__e1_38__relset_2
% 0.22/0.47  
%------------------------------------------------------------------------------