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

View Problem - Process Solution

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

% Computer : n028.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:45 EDT 2024

% Result   : Unsatisfiable 8.18s 1.64s
% Output   : CNFRefutation 8.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (   7 unt;   5 nHn;  24 RR)
%            Number of literals    :   55 (  16 equ;  25 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   35 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_51,plain,
    ( ~ c_in(X0,X1,tc_set(X2))
    | c_lessequals(X0,c_Union(X1,X2),tc_set(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnion__upper_0) ).

cnf(c_52,plain,
    c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).

cnf(c_53,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
    | c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin_OsuccI_0) ).

cnf(c_54,plain,
    ( ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2))))
    | c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).

cnf(c_55,plain,
    ( c_Zorn_Osucc(X0,X1,X2) != X1
    | ~ c_in(X1,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
    | ~ c_in(X3,c_Zorn_OTFin(X0,X2),tc_set(tc_set(X2)))
    | c_lessequals(X3,X1,tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Oeq__succ__upper_0) ).

cnf(c_56,negated_conjecture,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_57,negated_conjecture,
    ( c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) != v_m
    | c_Zorn_Osucc(v_S,v_m,t_a) != v_m ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_58,negated_conjecture,
    ( c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) = v_m
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_169,plain,
    ( ~ c_lessequals(X0,X1,tc_set(X2))
    | ~ c_lessequals(X1,X0,tc_set(X2))
    | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).

cnf(c_170,plain,
    c_lessequals(X0,X0,tc_set(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).

cnf(c_23508,plain,
    ( ~ c_lessequals(c_Zorn_Osucc(X0,X1,X2),X1,tc_set(tc_set(X2)))
    | c_Zorn_Osucc(X0,X1,X2) = X1 ),
    inference(superposition,[status(thm)],[c_52,c_169]) ).

cnf(c_23516,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m
    | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_58,c_51]) ).

cnf(c_23578,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m
    | c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_53,c_23516]) ).

cnf(c_23579,plain,
    ( ~ c_lessequals(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a))))
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m
    | c_lessequals(c_Union(X0,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_54,c_23516]) ).

cnf(c_23604,plain,
    ( ~ c_lessequals(c_Union(X0,X1),X2,tc_set(X1))
    | ~ c_in(X2,X0,tc_set(X1))
    | c_Union(X0,X1) = X2 ),
    inference(superposition,[status(thm)],[c_51,c_169]) ).

cnf(c_23649,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m
    | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_58,c_51]) ).

cnf(c_23733,plain,
    ( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Zorn_Osucc(v_S,v_m,t_a) = v_m ),
    inference(superposition,[status(thm)],[c_23578,c_23508]) ).

cnf(c_23741,plain,
    c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
    inference(global_subsumption_just,[status(thm)],[c_23579,c_56,c_23733]) ).

cnf(c_23746,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_23741,c_55]) ).

cnf(c_23786,plain,
    c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
    inference(global_subsumption_just,[status(thm)],[c_23649,c_56,c_23733]) ).

cnf(c_23791,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_23786,c_55]) ).

cnf(c_24025,plain,
    ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(global_subsumption_just,[status(thm)],[c_23791,c_56,c_23746]) ).

cnf(c_24032,plain,
    ( ~ c_lessequals(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a))))
    | c_lessequals(c_Union(X0,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_54,c_24025]) ).

cnf(c_24342,plain,
    c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    inference(superposition,[status(thm)],[c_170,c_24032]) ).

cnf(c_25197,plain,
    ( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) = v_m ),
    inference(superposition,[status(thm)],[c_24342,c_23604]) ).

cnf(c_25199,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_25197,c_23733,c_57,c_56]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET843-1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n028.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:36:33 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.16/0.44  Running first-order theorem proving
% 0.16/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
% 8.18/1.64  % SZS status Started for theBenchmark.p
% 8.18/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 8.18/1.64  
% 8.18/1.64  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.18/1.64  
% 8.18/1.64  ------  iProver source info
% 8.18/1.64  
% 8.18/1.64  git: date: 2024-05-02 19:28:25 +0000
% 8.18/1.64  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.18/1.64  git: non_committed_changes: false
% 8.18/1.64  
% 8.18/1.64  ------ Parsing...successful
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  
% 8.18/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 
% 8.18/1.64  
% 8.18/1.64  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 8.18/1.64  
% 8.18/1.64  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 8.18/1.64  ------ Proving...
% 8.18/1.64  ------ Problem Properties 
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  clauses                                 305
% 8.18/1.64  conjectures                             3
% 8.18/1.64  EPR                                     26
% 8.18/1.64  Horn                                    276
% 8.18/1.64  unary                                   77
% 8.18/1.64  binary                                  180
% 8.18/1.64  lits                                    582
% 8.18/1.64  lits eq                                 167
% 8.18/1.64  fd_pure                                 0
% 8.18/1.64  fd_pseudo                               0
% 8.18/1.64  fd_cond                                 21
% 8.18/1.64  fd_pseudo_cond                          40
% 8.18/1.64  AC symbols                              0
% 8.18/1.64  
% 8.18/1.64  ------ Input Options Time Limit: Unbounded
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  ------ 
% 8.18/1.64  Current options:
% 8.18/1.64  ------ 
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  ------ Proving...
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  ------ Proving...
% 8.18/1.64  
% 8.18/1.64  
% 8.18/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 8.18/1.64  
% 8.18/1.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.18/1.64  
% 8.18/1.64  
%------------------------------------------------------------------------------