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

View Problem - Process Solution

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

% Computer : n004.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:56:37 EDT 2023

% Result   : Unsatisfiable 399.57s 52.80s
% Output   : CNFRefutation 399.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   8 unt;   6 nHn;  19 RR)
%            Number of literals    :   43 (   4 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Message_Osynth__trans_0,axiom,
    ( c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_lessequals(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_Message_Osynth__trans_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_conjecture_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_Set_OsubsetI_0) ).

cnf(cls_Message_Osynth_OInj_0,axiom,
    ( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_Message_Osynth_OInj_0) ).

cnf(cls_Set_OinsertE_0,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_Set_OinsertE_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_conjecture_2) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p',cls_conjecture_1) ).

cnf(c_0_8,axiom,
    ( c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_lessequals(X2,c_Message_Osynth(X3),tc_set(tc_Message_Omsg)) ),
    cls_Message_Osynth__trans_0 ).

cnf(c_0_9,negated_conjecture,
    c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_10,negated_conjecture,
    ( c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg)
    | ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    cls_Set_OsubsetI_1 ).

cnf(c_0_12,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_13,negated_conjecture,
    ( c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg)
    | ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,axiom,
    ( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    cls_Message_Osynth_OInj_0 ).

cnf(c_0_15,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    cls_Set_OinsertE_0 ).

cnf(c_0_16,negated_conjecture,
    ( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg)
    | c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ( c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg)
    | ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),X1,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg) = v_X
    | c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(X1),tc_Message_Omsg),v_H,tc_Message_Omsg)
    | c_in(v_Y,c_Message_Osynth(X1),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
    cls_conjecture_2 ).

cnf(c_0_20,negated_conjecture,
    c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) = v_X,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    cls_conjecture_1 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_21])]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SWV274-1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.13  % Command    : run_E %s %d THM
% 0.11/0.34  % Computer : n004.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8042.1875MB
% 0.11/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34  % CPULimit   : 2400
% 0.11/0.34  % WCLimit    : 300
% 0.11/0.34  % DateTime   : Tue Oct  3 03:06:00 EDT 2023
% 0.11/0.34  % CPUTime    : 
% 0.18/0.50  Running first-order model finding
% 0.18/0.51  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.EMjULk5eID/E---3.1_21836.p
% 399.57/52.80  # Version: 3.1pre001
% 399.57/52.80  # Preprocessing class: FMLMSMSMSSSNFFN.
% 399.57/52.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 399.57/52.80  # Starting new_bool_3 with 300s (1) cores
% 399.57/52.80  # Starting new_bool_1 with 300s (1) cores
% 399.57/52.80  # Starting sh5l with 300s (1) cores
% 399.57/52.80  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21913 completed with status 0
% 399.57/52.80  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 399.57/52.80  # Preprocessing class: FMLMSMSMSSSNFFN.
% 399.57/52.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 399.57/52.80  # No SInE strategy applied
% 399.57/52.80  # Search class: FGHSM-SSLM32-MFFFFFNN
% 399.57/52.80  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 399.57/52.80  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 399.57/52.80  # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 399.57/52.80  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 399.57/52.80  # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 21924 completed with status 0
% 399.57/52.80  # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 399.57/52.80  # Preprocessing class: FMLMSMSMSSSNFFN.
% 399.57/52.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 399.57/52.80  # No SInE strategy applied
% 399.57/52.80  # Search class: FGHSM-SSLM32-MFFFFFNN
% 399.57/52.80  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 399.57/52.80  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 399.57/52.80  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 399.57/52.80  # Preprocessing time       : 0.009 s
% 399.57/52.80  # Presaturation interreduction done
% 399.57/52.80  
% 399.57/52.80  # Proof found!
% 399.57/52.80  # SZS status Unsatisfiable
% 399.57/52.80  # SZS output start CNFRefutation
% See solution above
% 399.57/52.80  # Parsed axioms                        : 1403
% 399.57/52.80  # Removed by relevancy pruning/SinE    : 0
% 399.57/52.80  # Initial clauses                      : 1403
% 399.57/52.80  # Removed in clause preprocessing      : 1
% 399.57/52.80  # Initial clauses in saturation        : 1402
% 399.57/52.80  # Processed clauses                    : 86643
% 399.57/52.80  # ...of these trivial                  : 2698
% 399.57/52.80  # ...subsumed                          : 67343
% 399.57/52.80  # ...remaining for further processing  : 16602
% 399.57/52.80  # Other redundant clauses eliminated   : 13
% 399.57/52.80  # Clauses deleted for lack of memory   : 0
% 399.57/52.80  # Backward-subsumed                    : 165
% 399.57/52.80  # Backward-rewritten                   : 3768
% 399.57/52.80  # Generated clauses                    : 1547325
% 399.57/52.80  # ...of the previous two non-redundant : 1245737
% 399.57/52.80  # ...aggressively subsumed             : 0
% 399.57/52.80  # Contextual simplify-reflections      : 14
% 399.57/52.80  # Paramodulations                      : 1547251
% 399.57/52.80  # Factorizations                       : 8
% 399.57/52.80  # NegExts                              : 0
% 399.57/52.80  # Equation resolutions                 : 66
% 399.57/52.80  # Total rewrite steps                  : 1567251
% 399.57/52.80  # Propositional unsat checks           : 3
% 399.57/52.80  #    Propositional check models        : 0
% 399.57/52.80  #    Propositional check unsatisfiable : 0
% 399.57/52.80  #    Propositional clauses             : 0
% 399.57/52.80  #    Propositional clauses after purity: 0
% 399.57/52.80  #    Propositional unsat core size     : 0
% 399.57/52.80  #    Propositional preprocessing time  : 0.000
% 399.57/52.80  #    Propositional encoding time       : 8.827
% 399.57/52.80  #    Propositional solver time         : 3.581
% 399.57/52.80  #    Success case prop preproc time    : 0.000
% 399.57/52.80  #    Success case prop encoding time   : 0.000
% 399.57/52.80  #    Success case prop solver time     : 0.000
% 399.57/52.80  # Current number of processed clauses  : 11306
% 399.57/52.80  #    Positive orientable unit clauses  : 3237
% 399.57/52.80  #    Positive unorientable unit clauses: 0
% 399.57/52.80  #    Negative unit clauses             : 1018
% 399.57/52.80  #    Non-unit-clauses                  : 7051
% 399.57/52.80  # Current number of unprocessed clauses: 1148555
% 399.57/52.80  # ...number of literals in the above   : 2343371
% 399.57/52.80  # Current number of archived formulas  : 0
% 399.57/52.80  # Current number of archived clauses   : 5296
% 399.57/52.80  # Clause-clause subsumption calls (NU) : 15862976
% 399.57/52.80  # Rec. Clause-clause subsumption calls : 14349054
% 399.57/52.80  # Non-unit clause-clause subsumptions  : 22225
% 399.57/52.80  # Unit Clause-clause subsumption calls : 724010
% 399.57/52.80  # Rewrite failures with RHS unbound    : 0
% 399.57/52.80  # BW rewrite match attempts            : 244473
% 399.57/52.80  # BW rewrite match successes           : 999
% 399.57/52.80  # Condensation attempts                : 0
% 399.57/52.80  # Condensation successes               : 0
% 399.57/52.80  # Termbank termtop insertions          : 76796584
% 399.57/52.80  
% 399.57/52.80  # -------------------------------------------------
% 399.57/52.80  # User time                : 48.420 s
% 399.57/52.80  # System time              : 1.314 s
% 399.57/52.80  # Total time               : 49.733 s
% 399.57/52.80  # Maximum resident set size: 3796 pages
% 399.57/52.80  
% 399.57/52.80  # -------------------------------------------------
% 399.57/52.80  # User time                : 242.717 s
% 399.57/52.80  # System time              : 6.346 s
% 399.57/52.80  # Total time               : 249.064 s
% 399.57/52.80  # Maximum resident set size: 2432 pages
% 399.57/52.80  % E---3.1 exiting
%------------------------------------------------------------------------------