TSTP Solution File: SET865-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SET865-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n012.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 : Fri May  3 03:01:52 EDT 2024

% Result   : Unsatisfiable 7.85s 1.64s
% Output   : CNFRefutation 7.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   16 (   6 unt;   0 nHn;  13 RR)
%            Number of literals    :   31 (   4 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    c_in(c_Zorn_OHausdorff__1(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OHausdorff_0) ).

cnf(c_50,plain,
    ( ~ c_in(X0,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
    | ~ c_lessequals(c_Union(X0,X2),X3,tc_set(X2))
    | ~ c_in(X3,X1,tc_set(X2))
    | c_Union(X0,X2) = X3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).

cnf(c_51,plain,
    c_lessequals(c_Zorn_Omaxchain(X0,X1),c_Zorn_Ochain(X0,X1),tc_set(tc_set(tc_set(X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__subset__chain_0) ).

cnf(c_52,negated_conjecture,
    ( ~ c_in(X0,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
    | c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_53,negated_conjecture,
    ( ~ c_in(X0,v_S,tc_set(t_a))
    | c_in(v_x(X0),v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_54,negated_conjecture,
    ( ~ c_in(X0,v_S,tc_set(t_a))
    | c_lessequals(X0,v_x(X0),tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_55,negated_conjecture,
    ( v_x(X0) != X0
    | ~ c_in(X0,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(c_163,plain,
    ( ~ c_lessequals(X0,X1,tc_set(X2))
    | ~ c_in(X3,X0,X2)
    | c_in(X3,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).

cnf(c_23370,plain,
    ( ~ c_in(X0,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
    | c_in(X0,c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2))) ),
    inference(superposition,[status(thm)],[c_51,c_163]) ).

cnf(c_23403,plain,
    ( ~ c_lessequals(c_Union(c_Zorn_OHausdorff__1(X0,X1),X1),X2,tc_set(X1))
    | ~ c_in(X2,X0,tc_set(X1))
    | c_Union(c_Zorn_OHausdorff__1(X0,X1),X1) = X2 ),
    inference(superposition,[status(thm)],[c_49,c_50]) ).

cnf(c_23416,plain,
    c_in(c_Zorn_OHausdorff__1(X0,X1),c_Zorn_Ochain(X0,X1),tc_set(tc_set(X1))),
    inference(superposition,[status(thm)],[c_49,c_23370]) ).

cnf(c_23446,plain,
    ( ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)),X0,tc_set(t_a))
    | ~ c_in(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a),v_S,tc_set(t_a))
    | v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)) = c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a) ),
    inference(superposition,[status(thm)],[c_54,c_23403]) ).

cnf(c_23456,plain,
    c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
    inference(superposition,[status(thm)],[c_23416,c_52]) ).

cnf(c_23487,plain,
    ( ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)),X0,tc_set(t_a))
    | ~ c_in(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a),v_S,tc_set(t_a)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_23446,c_55]) ).

cnf(c_23490,plain,
    ~ c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
    inference(superposition,[status(thm)],[c_53,c_23487]) ).

cnf(c_23492,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_23490,c_23456]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SET865-1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n012.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 20:31:25 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.85/1.64  % SZS status Started for theBenchmark.p
% 7.85/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 7.85/1.64  
% 7.85/1.64  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.85/1.64  
% 7.85/1.64  ------  iProver source info
% 7.85/1.64  
% 7.85/1.64  git: date: 2024-05-02 19:28:25 +0000
% 7.85/1.64  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.85/1.64  git: non_committed_changes: false
% 7.85/1.64  
% 7.85/1.64  ------ Parsing...successful
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  ------ Preprocessing... sup_sim: 1  sf_s  rm: 823 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e 
% 7.85/1.64  
% 7.85/1.64  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.85/1.64  
% 7.85/1.64  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.85/1.64  ------ Proving...
% 7.85/1.64  ------ Problem Properties 
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  clauses                                 302
% 7.85/1.64  conjectures                             4
% 7.85/1.64  EPR                                     26
% 7.85/1.64  Horn                                    275
% 7.85/1.64  unary                                   77
% 7.85/1.64  binary                                  177
% 7.85/1.64  lits                                    576
% 7.85/1.64  lits eq                                 164
% 7.85/1.64  fd_pure                                 0
% 7.85/1.64  fd_pseudo                               0
% 7.85/1.64  fd_cond                                 21
% 7.85/1.64  fd_pseudo_cond                          41
% 7.85/1.64  AC symbols                              0
% 7.85/1.64  
% 7.85/1.64  ------ Input Options Time Limit: Unbounded
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  ------ 
% 7.85/1.64  Current options:
% 7.85/1.64  ------ 
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  ------ Proving...
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  ------ Proving...
% 7.85/1.64  
% 7.85/1.64  
% 7.85/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 7.85/1.64  
% 7.85/1.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.85/1.64  
% 7.85/1.64  
%------------------------------------------------------------------------------