TSTP Solution File: SET844-2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n003.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 05:29:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    c_lessequals(u,u,tc_set(v)),
    file('SET844-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_lessequals(u,c_Zorn_OTFin(v,w),tc_set(tc_set(tc_set(w))))
    | c_in(c_Union(u,tc_set(w)),c_Zorn_OTFin(v,w),tc_set(tc_set(w))) ),
    file('SET844-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ equal(c_Zorn_Osucc(u,v,w),v)
    | ~ c_in(x,c_Zorn_OTFin(u,w),tc_set(tc_set(w)))
    | ~ c_in(v,c_Zorn_OTFin(u,w),tc_set(tc_set(w)))
    | c_lessequals(x,v,tc_set(tc_set(w))) ),
    file('SET844-2.p',unknown),
    [] ).

cnf(4,axiom,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('SET844-2.p',unknown),
    [] ).

cnf(5,axiom,
    equal(c_Zorn_Osucc(v_S,v_m,t_a),v_m),
    file('SET844-2.p',unknown),
    [] ).

cnf(6,axiom,
    ~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    file('SET844-2.p',unknown),
    [] ).

cnf(10,plain,
    ( ~ equal(c_Zorn_Osucc(u,v_m,t_a),v_m)
    | ~ c_in(v_m,c_Zorn_OTFin(u,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(u,t_a),tc_set(tc_set(t_a))) ),
    inference(res,[status(thm),theory(equality)],[3,6]),
    [iquote('0:Res:3.3,6.0')] ).

cnf(13,plain,
    ( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(res,[status(thm),theory(equality)],[5,10]),
    [iquote('0:Res:5.0,10.2')] ).

cnf(15,plain,
    ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    inference(mrr,[status(thm)],[13,4]),
    [iquote('0:MRR:13.0,4.0')] ).

cnf(17,plain,
    ~ c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),
    inference(res,[status(thm),theory(equality)],[2,15]),
    [iquote('0:Res:2.1,15.0')] ).

cnf(18,plain,
    $false,
    inference(mrr,[status(thm)],[17,1]),
    [iquote('0:MRR:17.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 23:07:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.19/0.41  SPASS allocated 63105 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 3, length 11 :
% 0.19/0.41  % SZS output start Refutation
% See solution above
% 0.19/0.41  Formulae used in the proof : cls_Set_Osubset__refl_0 cls_Zorn_OTFin__UnionI_0 cls_Zorn_Oeq__succ__upper_0 cls_conjecture_0 cls_conjecture_1 cls_conjecture_2
% 0.19/0.41  
%------------------------------------------------------------------------------