TSTP Solution File: SWV885-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWV885-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:08:04 EDT 2023

% Result   : Unsatisfiable 1.83s 0.74s
% Output   : CNFRefutation 1.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   29 (  22 unt;   2 nHn;  21 RR)
%            Number of literals    :   40 (  17 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-4 aty)
%            Number of variables   :   34 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_finite__surj_0,axiom,
    ( c_Finite__Set_Ofinite(X1,X2)
    | ~ c_lessequals(X1,c_Set_Oimage(X3,X4,X5,X2),tc_fun(X2,tc_bool))
    | ~ c_Finite__Set_Ofinite(X4,X5) ),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_finite__surj_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Finite__Set_Ofinite(v_U,tc_Com_Opname),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_0) ).

cnf(cls_le__imp__diff__is__add_0,axiom,
    ( X2 = c_HOL_Oplus__class_Oplus(c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),X1,tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_le__imp__diff__is__add_0) ).

cnf(cls_nat__add__commute_0,axiom,
    c_HOL_Oplus__class_Oplus(X1,X2,tc_nat) = c_HOL_Oplus__class_Oplus(X2,X1,tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_nat__add__commute_0) ).

cnf(cls_conjecture_6,negated_conjecture,
    c_Finite__Set_Ocard(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),t_a) != c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_6) ).

cnf(cls_card__insert__if_1,axiom,
    ( c_Finite__Set_Ocard(c_Set_Oinsert(X1,X2,X3),X3) = c_Suc(c_Finite__Set_Ocard(X2,X3))
    | c_in(X1,X2,X3)
    | ~ c_Finite__Set_Ofinite(X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_card__insert__if_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    ~ c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_5) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_Finite__Set_Ocard(v_G,t_a) = c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),c_Suc(v_na),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_3) ).

cnf(cls_add__Suc__shift_0,axiom,
    c_HOL_Oplus__class_Oplus(c_Suc(X1),X2,tc_nat) = c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_add__Suc__shift_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(c_Suc(v_na),c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_conjecture_2) ).

cnf(cls_diff__add__inverse_0,axiom,
    c_HOL_Ominus__class_Ominus(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X1,tc_nat) = X2,
    file('/export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p',cls_diff__add__inverse_0) ).

cnf(c_0_12,axiom,
    ( c_Finite__Set_Ofinite(X1,X2)
    | ~ c_lessequals(X1,c_Set_Oimage(X3,X4,X5,X2),tc_fun(X2,tc_bool))
    | ~ c_Finite__Set_Ofinite(X4,X5) ),
    cls_finite__surj_0 ).

cnf(c_0_13,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    cls_conjecture_1 ).

cnf(c_0_14,negated_conjecture,
    c_Finite__Set_Ofinite(v_U,tc_Com_Opname),
    cls_conjecture_0 ).

cnf(c_0_15,axiom,
    ( X2 = c_HOL_Oplus__class_Oplus(c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),X1,tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    cls_le__imp__diff__is__add_0 ).

cnf(c_0_16,axiom,
    c_HOL_Oplus__class_Oplus(X1,X2,tc_nat) = c_HOL_Oplus__class_Oplus(X2,X1,tc_nat),
    cls_nat__add__commute_0 ).

cnf(c_0_17,negated_conjecture,
    c_Finite__Set_Ocard(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),t_a) != c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat),
    cls_conjecture_6 ).

cnf(c_0_18,axiom,
    ( c_Finite__Set_Ocard(c_Set_Oinsert(X1,X2,X3),X3) = c_Suc(c_Finite__Set_Ocard(X2,X3))
    | c_in(X1,X2,X3)
    | ~ c_Finite__Set_Ofinite(X2,X3) ),
    cls_card__insert__if_1 ).

cnf(c_0_19,negated_conjecture,
    ~ c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
    cls_conjecture_5 ).

cnf(c_0_20,negated_conjecture,
    c_Finite__Set_Ofinite(v_G,t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_21,plain,
    ( c_HOL_Oplus__class_Oplus(X1,c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),tc_nat) = X2
    | ~ c_lessequals(X1,X2,tc_nat) ),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    c_Finite__Set_Ocard(v_G,t_a) = c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),c_Suc(v_na),tc_nat),
    cls_conjecture_3 ).

cnf(c_0_23,axiom,
    c_HOL_Oplus__class_Oplus(c_Suc(X1),X2,tc_nat) = c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat),
    cls_add__Suc__shift_0 ).

cnf(c_0_24,negated_conjecture,
    c_lessequals(c_Suc(v_na),c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),tc_nat),
    cls_conjecture_2 ).

cnf(c_0_25,negated_conjecture,
    c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat) != c_Suc(c_Finite__Set_Ocard(v_G,t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_26,negated_conjecture,
    c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a) = c_HOL_Oplus__class_Oplus(v_na,c_Suc(c_Finite__Set_Ocard(v_G,t_a)),tc_nat),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

cnf(c_0_27,axiom,
    c_HOL_Ominus__class_Ominus(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X1,tc_nat) = X2,
    cls_diff__add__inverse_0 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem    : SWV885-1 : TPTP v8.1.2. Released v4.1.0.
% 0.04/0.09  % Command    : run_E %s %d THM
% 0.09/0.29  % Computer : n023.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 2400
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Tue Oct  3 03:33:07 EDT 2023
% 0.09/0.29  % CPUTime    : 
% 0.14/0.47  Running first-order model finding
% 0.14/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.MmMbcPKLVm/E---3.1_21781.p
% 1.83/0.74  # Version: 3.1pre001
% 1.83/0.74  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.83/0.74  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.74  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.83/0.74  # Starting new_bool_3 with 300s (1) cores
% 1.83/0.74  # Starting new_bool_1 with 300s (1) cores
% 1.83/0.74  # Starting sh5l with 300s (1) cores
% 1.83/0.74  # new_bool_1 with pid 21860 completed with status 0
% 1.83/0.74  # Result found by new_bool_1
% 1.83/0.74  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.83/0.74  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.74  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.83/0.74  # Starting new_bool_3 with 300s (1) cores
% 1.83/0.74  # Starting new_bool_1 with 300s (1) cores
% 1.83/0.74  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.83/0.74  # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.83/0.74  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.74  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.83/0.74  # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 21862 completed with status 0
% 1.83/0.74  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.83/0.74  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.83/0.74  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.74  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.83/0.74  # Starting new_bool_3 with 300s (1) cores
% 1.83/0.74  # Starting new_bool_1 with 300s (1) cores
% 1.83/0.74  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.83/0.74  # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.83/0.74  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.74  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.83/0.74  # Preprocessing time       : 0.021 s
% 1.83/0.74  
% 1.83/0.74  # Proof found!
% 1.83/0.74  # SZS status Unsatisfiable
% 1.83/0.74  # SZS output start CNFRefutation
% See solution above
% 1.83/0.74  # Parsed axioms                        : 1121
% 1.83/0.74  # Removed by relevancy pruning/SinE    : 505
% 1.83/0.74  # Initial clauses                      : 616
% 1.83/0.74  # Removed in clause preprocessing      : 0
% 1.83/0.74  # Initial clauses in saturation        : 616
% 1.83/0.74  # Processed clauses                    : 747
% 1.83/0.74  # ...of these trivial                  : 45
% 1.83/0.74  # ...subsumed                          : 180
% 1.83/0.74  # ...remaining for further processing  : 522
% 1.83/0.74  # Other redundant clauses eliminated   : 5
% 1.83/0.74  # Clauses deleted for lack of memory   : 0
% 1.83/0.74  # Backward-subsumed                    : 7
% 1.83/0.74  # Backward-rewritten                   : 33
% 1.83/0.74  # Generated clauses                    : 9614
% 1.83/0.74  # ...of the previous two non-redundant : 8108
% 1.83/0.74  # ...aggressively subsumed             : 0
% 1.83/0.74  # Contextual simplify-reflections      : 4
% 1.83/0.74  # Paramodulations                      : 9589
% 1.83/0.74  # Factorizations                       : 4
% 1.83/0.74  # NegExts                              : 0
% 1.83/0.74  # Equation resolutions                 : 21
% 1.83/0.74  # Total rewrite steps                  : 7793
% 1.83/0.74  # Propositional unsat checks           : 0
% 1.83/0.74  #    Propositional check models        : 0
% 1.83/0.74  #    Propositional check unsatisfiable : 0
% 1.83/0.74  #    Propositional clauses             : 0
% 1.83/0.74  #    Propositional clauses after purity: 0
% 1.83/0.74  #    Propositional unsat core size     : 0
% 1.83/0.74  #    Propositional preprocessing time  : 0.000
% 1.83/0.74  #    Propositional encoding time       : 0.000
% 1.83/0.74  #    Propositional solver time         : 0.000
% 1.83/0.74  #    Success case prop preproc time    : 0.000
% 1.83/0.74  #    Success case prop encoding time   : 0.000
% 1.83/0.74  #    Success case prop solver time     : 0.000
% 1.83/0.74  # Current number of processed clauses  : 482
% 1.83/0.74  #    Positive orientable unit clauses  : 104
% 1.83/0.74  #    Positive unorientable unit clauses: 10
% 1.83/0.74  #    Negative unit clauses             : 17
% 1.83/0.74  #    Non-unit-clauses                  : 351
% 1.83/0.74  # Current number of unprocessed clauses: 7964
% 1.83/0.74  # ...number of literals in the above   : 20149
% 1.83/0.74  # Current number of archived formulas  : 0
% 1.83/0.74  # Current number of archived clauses   : 40
% 1.83/0.74  # Clause-clause subsumption calls (NU) : 18593
% 1.83/0.74  # Rec. Clause-clause subsumption calls : 16805
% 1.83/0.74  # Non-unit clause-clause subsumptions  : 134
% 1.83/0.74  # Unit Clause-clause subsumption calls : 1129
% 1.83/0.74  # Rewrite failures with RHS unbound    : 15
% 1.83/0.74  # BW rewrite match attempts            : 144
% 1.83/0.74  # BW rewrite match successes           : 78
% 1.83/0.74  # Condensation attempts                : 0
% 1.83/0.74  # Condensation successes               : 0
% 1.83/0.74  # Termbank termtop insertions          : 181345
% 1.83/0.74  
% 1.83/0.74  # -------------------------------------------------
% 1.83/0.74  # User time                : 0.210 s
% 1.83/0.74  # System time              : 0.015 s
% 1.83/0.74  # Total time               : 0.225 s
% 1.83/0.74  # Maximum resident set size: 3244 pages
% 1.83/0.74  
% 1.83/0.74  # -------------------------------------------------
% 1.83/0.74  # User time                : 0.237 s
% 1.83/0.74  # System time              : 0.017 s
% 1.83/0.74  # Total time               : 0.254 s
% 1.83/0.74  # Maximum resident set size: 2468 pages
% 1.83/0.74  % E---3.1 exiting
%------------------------------------------------------------------------------