TSTP Solution File: SWV242-2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWV242-2 : 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:56:27 EDT 2023

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  16 RR)
%            Number of literals    :   32 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   28 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_Set_Osubset__trans_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_conjecture_1) ).

cnf(cls_Message_Oanalz__mono_0,axiom,
    ( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_Message_Oanalz__mono_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_conjecture_2) ).

cnf(cls_Set_OUn__upper2_0,axiom,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_Set_OUn__upper2_0) ).

cnf(cls_Set_OUn__upper1_0,axiom,
    c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
    file('/export/starexec/sandbox/tmp/tmp.7dWD68nE4O/E---3.1_11560.p',cls_Set_OUn__upper1_0) ).

cnf(c_0_7,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    cls_Set_Osubset__trans_0 ).

cnf(c_0_8,negated_conjecture,
    c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
    cls_conjecture_1 ).

cnf(c_0_9,negated_conjecture,
    ( c_lessequals(v_H,X1,tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(v_H_H),X1,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    ( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    cls_Message_Oanalz__mono_0 ).

cnf(c_0_11,negated_conjecture,
    c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
    cls_conjecture_0 ).

cnf(c_0_12,negated_conjecture,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    cls_conjecture_2 ).

cnf(c_0_13,negated_conjecture,
    ( c_lessequals(v_H,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_H_H,X1,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,axiom,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    cls_Set_OUn__upper2_0 ).

cnf(c_0_15,negated_conjecture,
    ( c_lessequals(v_G,X1,tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(v_G_H),X1,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    ( c_lessequals(v_G,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G_H,X1,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_18,axiom,
    c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
    cls_Set_OUn__upper1_0 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV242-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : run_E %s %d THM
% 0.11/0.34  % Computer : n025.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 04:33:51 EDT 2023
% 0.11/0.34  % CPUTime    : 
% 0.18/0.45  Running first-order model finding
% 0.18/0.45  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.7dWD68nE4O/E---3.1_11560.p
% 0.18/0.46  # Version: 3.1pre001
% 0.18/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # Starting sh5l with 300s (1) cores
% 0.18/0.46  # new_bool_1 with pid 11653 completed with status 0
% 0.18/0.46  # Result found by new_bool_1
% 0.18/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  # Search class: FHHNS-FFSF31-SFFFFFNN
% 0.18/0.46  # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.18/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46  # SAT001_MinMin_p005000_rr_RG with pid 11658 completed with status 0
% 0.18/0.46  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  # Search class: FHHNS-FFSF31-SFFFFFNN
% 0.18/0.46  # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.18/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46  # Preprocessing time       : 0.001 s
% 0.18/0.46  # Presaturation interreduction done
% 0.18/0.46  
% 0.18/0.46  # Proof found!
% 0.18/0.46  # SZS status Unsatisfiable
% 0.18/0.46  # SZS output start CNFRefutation
% See solution above
% 0.18/0.46  # Parsed axioms                        : 7
% 0.18/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.46  # Initial clauses                      : 7
% 0.18/0.46  # Removed in clause preprocessing      : 0
% 0.18/0.46  # Initial clauses in saturation        : 7
% 0.18/0.46  # Processed clauses                    : 26
% 0.18/0.46  # ...of these trivial                  : 0
% 0.18/0.46  # ...subsumed                          : 0
% 0.18/0.46  # ...remaining for further processing  : 26
% 0.18/0.46  # Other redundant clauses eliminated   : 0
% 0.18/0.46  # Clauses deleted for lack of memory   : 0
% 0.18/0.46  # Backward-subsumed                    : 1
% 0.18/0.46  # Backward-rewritten                   : 0
% 0.18/0.46  # Generated clauses                    : 26
% 0.18/0.46  # ...of the previous two non-redundant : 25
% 0.18/0.46  # ...aggressively subsumed             : 0
% 0.18/0.46  # Contextual simplify-reflections      : 0
% 0.18/0.46  # Paramodulations                      : 26
% 0.18/0.46  # Factorizations                       : 0
% 0.18/0.46  # NegExts                              : 0
% 0.18/0.46  # Equation resolutions                 : 0
% 0.18/0.46  # Total rewrite steps                  : 2
% 0.18/0.46  # Propositional unsat checks           : 0
% 0.18/0.46  #    Propositional check models        : 0
% 0.18/0.46  #    Propositional check unsatisfiable : 0
% 0.18/0.46  #    Propositional clauses             : 0
% 0.18/0.46  #    Propositional clauses after purity: 0
% 0.18/0.46  #    Propositional unsat core size     : 0
% 0.18/0.46  #    Propositional preprocessing time  : 0.000
% 0.18/0.46  #    Propositional encoding time       : 0.000
% 0.18/0.46  #    Propositional solver time         : 0.000
% 0.18/0.46  #    Success case prop preproc time    : 0.000
% 0.18/0.46  #    Success case prop encoding time   : 0.000
% 0.18/0.46  #    Success case prop solver time     : 0.000
% 0.18/0.46  # Current number of processed clauses  : 18
% 0.18/0.46  #    Positive orientable unit clauses  : 8
% 0.18/0.46  #    Positive unorientable unit clauses: 0
% 0.18/0.46  #    Negative unit clauses             : 1
% 0.18/0.46  #    Non-unit-clauses                  : 9
% 0.18/0.46  # Current number of unprocessed clauses: 12
% 0.18/0.46  # ...number of literals in the above   : 22
% 0.18/0.46  # Current number of archived formulas  : 0
% 0.18/0.46  # Current number of archived clauses   : 8
% 0.18/0.46  # Clause-clause subsumption calls (NU) : 4
% 0.18/0.46  # Rec. Clause-clause subsumption calls : 4
% 0.18/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.18/0.46  # Unit Clause-clause subsumption calls : 1
% 0.18/0.46  # Rewrite failures with RHS unbound    : 0
% 0.18/0.46  # BW rewrite match attempts            : 2
% 0.18/0.46  # BW rewrite match successes           : 0
% 0.18/0.46  # Condensation attempts                : 0
% 0.18/0.46  # Condensation successes               : 0
% 0.18/0.46  # Termbank termtop insertions          : 649
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.002 s
% 0.18/0.46  # System time              : 0.002 s
% 0.18/0.46  # Total time               : 0.005 s
% 0.18/0.46  # Maximum resident set size: 1640 pages
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.004 s
% 0.18/0.46  # System time              : 0.004 s
% 0.18/0.46  # Total time               : 0.007 s
% 0.18/0.46  # Maximum resident set size: 1672 pages
% 0.18/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------