TSTP Solution File: SWV279-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV279-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 19:44:01 EDT 2023

% Result   : Timeout 42.24s 300.26s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (   9 unt;   0 nHn;  22 RR)
%            Number of literals    :   46 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   55 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Message_OMPair__parts_0,axiom,
    ( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Message_OMPair__parts_0) ).

cnf(cls_Message_Oparts_OInj_0,axiom,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Message_Oparts_OInj_0) ).

cnf(cls_Set_OsubsetD_0,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Set_OsubsetD_0) ).

cnf(cls_Public_Oused__parts__subset__parts_0,axiom,
    ( c_lessequals(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Event_Oused(X2),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Public_Oused__parts__subset__parts_0) ).

cnf(cls_Set_Oinsert__iff_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Set_Oinsert__iff_1) ).

cnf(cls_Message_OMPair__parts_1,axiom,
    ( c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_Message_OMPair__parts_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Event_Oused(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( ~ c_in(v_Y,c_Event_Oused(v_H),tc_Message_Omsg)
    | ~ c_in(v_X,c_Event_Oused(v_H),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p',cls_conjecture_1) ).

cnf(c_0_8,axiom,
    ( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    cls_Message_OMPair__parts_0 ).

cnf(c_0_9,axiom,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    cls_Message_Oparts_OInj_0 ).

cnf(c_0_10,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    cls_Set_OsubsetD_0 ).

cnf(c_0_11,axiom,
    ( c_lessequals(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Event_Oused(X2),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    cls_Public_Oused__parts__subset__parts_0 ).

cnf(c_0_12,plain,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X3,X1),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_Oinsert__iff_1 ).

cnf(c_0_14,axiom,
    ( c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    cls_Message_OMPair__parts_1 ).

cnf(c_0_15,plain,
    ( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Oparts(c_insert(X3,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_in(X3,c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    c_in(X1,c_Message_Oparts(c_insert(c_Message_Omsg_OMPair(X2,X1),X3,tc_Message_Omsg)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X3),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_14,c_0_9]) ).

cnf(c_0_18,plain,
    ( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X3,X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Event_Oused(v_H),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_20,plain,
    c_in(X1,c_Message_Oparts(c_insert(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_17,c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ c_in(v_Y,c_Event_Oused(v_H),tc_Message_Omsg)
    | ~ c_in(v_X,c_Event_Oused(v_H),tc_Message_Omsg) ),
    cls_conjecture_1 ).

cnf(c_0_22,negated_conjecture,
    c_in(v_Y,c_Event_Oused(v_H),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X3),c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ~ c_in(v_X,c_Event_Oused(v_H),tc_Message_Omsg),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.32  % Problem    : SWV279-1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.33  % Command    : run_E %s %d THM
% 0.32/0.53  % Computer : n025.cluster.edu
% 0.32/0.53  % Model    : x86_64 x86_64
% 0.32/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.32/0.53  % Memory   : 8042.1875MB
% 0.32/0.53  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.32/0.53  % CPULimit   : 2400
% 0.32/0.53  % WCLimit    : 300
% 0.32/0.53  % DateTime   : Tue Oct  3 04:15:37 EDT 2023
% 0.32/0.53  % CPUTime    : 
% 0.77/0.97  Running first-order theorem proving
% 0.77/0.97  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.1AbjZEA1Es/E---3.1_3494.p
% 42.24/300.26  # Version: 3.1pre001
% 42.24/300.26  # Preprocessing class: FMLMSMSMSSSNFFN.
% 42.24/300.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.24/300.26  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 42.24/300.26  # Starting new_bool_3 with 300s (1) cores
% 42.24/300.26  # Starting new_bool_1 with 300s (1) cores
% 42.24/300.26  # Starting sh5l with 300s (1) cores
% 42.24/300.26  # new_bool_3 with pid 3647 completed with status 0
% 42.24/300.26  # Result found by new_bool_3
% 42.24/300.26  # Preprocessing class: FMLMSMSMSSSNFFN.
% 42.24/300.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.24/300.26  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 42.24/300.26  # Starting new_bool_3 with 300s (1) cores
% 42.24/300.26  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 42.24/300.26  # Search class: FGHSM-FSLM32-MFFFFFNN
% 42.24/300.26  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 42.24/300.26  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 42.24/300.26  # G-E--_303_C18_F1_URBAN_S0Y with pid 3650 completed with status 0
% 42.24/300.26  # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 42.24/300.26  # Preprocessing class: FMLMSMSMSSSNFFN.
% 42.24/300.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.24/300.26  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 42.24/300.26  # Starting new_bool_3 with 300s (1) cores
% 42.24/300.26  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 42.24/300.26  # Search class: FGHSM-FSLM32-MFFFFFNN
% 42.24/300.26  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 42.24/300.26  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 42.24/300.26  # Preprocessing time       : 0.010 s
% 42.24/300.26  
% 42.24/300.26  # Proof found!
% 42.24/300.26  # SZS status Unsatisfiable
% 42.24/300.26  # SZS output start CNFRefutation
% See solution above
% 42.24/300.26  # Parsed axioms                        : 2918
% 42.24/300.26  # Removed by relevancy pruning/SinE    : 2407
% 42.24/300.26  # Initial clauses                      : 511
% 42.24/300.26  # Removed in clause preprocessing      : 0
% 42.24/300.26  # Initial clauses in saturation        : 511
% 42.24/300.26  # Processed clauses                    : 7305
% 42.24/300.26  # ...of these trivial                  : 129
% 42.24/300.26  # ...subsumed                          : 4120
% 42.24/300.26  # ...remaining for further processing  : 3056
% 42.24/300.26  # Other redundant clauses eliminated   : 45
% 42.24/300.26  # Clauses deleted for lack of memory   : 0
% 42.24/300.26  # Backward-subsumed                    : 79
% 42.24/300.26  # Backward-rewritten                   : 113
% 42.24/300.26  # Generated clauses                    : 131135
% 42.24/300.26  # ...of the previous two non-redundant : 121301
% 42.24/300.26  # ...aggressively subsumed             : 0
% 42.24/300.26  # Contextual simplify-reflections      : 23
% 42.24/300.26  # Paramodulations                      : 131035
% 42.24/300.26  # Factorizations                       : 0
% 42.24/300.26  # NegExts                              : 0
% 42.24/300.26  # Equation resolutions                 : 100
% 42.24/300.26  # Total rewrite steps                  : 65054
% 42.24/300.26  # Propositional unsat checks           : 0
% 42.24/300.26  #    Propositional check models        : 0
% 42.24/300.26  #    Propositional check unsatisfiable : 0
% 42.24/300.26  #    Propositional clauses             : 0
% 42.24/300.26  #    Propositional clauses after purity: 0
% 42.24/300.26  #    Propositional unsat core size     : 0
% 42.24/300.26  #    Propositional preprocessing time  : 0.000
% 42.24/300.26  #    Propositional encoding time       : 0.000
% 42.24/300.26  #    Propositional solver time         : 0.000
% 42.24/300.26  #    Success case prop preproc time    : 0.000
% 42.24/300.26  #    Success case prop encoding time   : 0.000
% 42.24/300.26  #    Success case prop solver time     : 0.000
% 42.24/300.26  # Current number of processed clauses  : 2864
% 42.24/300.26  #    Positive orientable unit clauses  : 386
% 42.24/300.26  #    Positive unorientable unit clauses: 11
% 42.24/300.26  #    Negative unit clauses             : 288
% 42.24/300.26  #    Non-unit-clauses                  : 2179
% 42.24/300.26  # Current number of unprocessed clauses: 114256
% 42.24/300.26  # ...number of literals in the above   : 330576
% 42.24/300.26  # Current number of archived formulas  : 0
% 42.24/300.26  # Current number of archived clauses   : 192
% 42.24/300.26  # Clause-clause subsumption calls (NU) : 883321
% 42.24/300.26  # Rec. Clause-clause subsumption calls : 588507
% 42.24/300.26  # Non-unit clause-clause subsumptions  : 1488
% 42.24/300.26  # Unit Clause-clause subsumption calls : 128974
% 42.24/300.26  # Rewrite failures with RHS unbound    : 0
% 42.24/300.26  # BW rewrite match attempts            : 837
% 42.24/300.26  # BW rewrite match successes           : 72
% 42.24/300.26  # Condensation attempts                : 0
% 42.24/300.26  # Condensation successes               : 0
% 42.24/300.26  # Termbank termtop insertions          : 2742068
% 42.24/300.26  
% 42.24/300.26  # -------------------------------------------------
% 42.24/300.26  # User time                : 3.306 s
% 42.24/300.26  # System time              : 0.103 s
% 42.24/300.26  # Total time               : 3.410 s
% 42.24/300.26  # Maximum resident set size: 4600 pages
% 42.24/300.26  
% 42.24/300.26  # -------------------------------------------------
% 42.24/300.26  # User time                : 3.353 s
% 42.24/300.26  # System time              : 0.109 s
% 42.24/300.26  # Total time               : 3.463 s
% 42.24/300.26  # Maximum resident set size: 3588 pages
% 42.24/300.26  % E---3.1 exiting
% 42.24/300.26  % E---3.1 exiting
%------------------------------------------------------------------------------