TSTP Solution File: SWV245-2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SWV245-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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 : Tue May 21 05:33:47 EDT 2024

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   32 (  11 unt;   7 nHn;  24 RR)
%            Number of literals    :   59 (   0 equ;  25 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   68 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OUnE_0,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnE_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Set_OUnCI_1,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).

cnf(cls_Message_OMPair__analz_1,axiom,
    ( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_OMPair__analz_1) ).

cnf(cls_Message_Oanalz_OInj_0,axiom,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz_OInj_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Set_OUnCI_0,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).

cnf(cls_Message_OMPair__synth_1,axiom,
    ( c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_OMPair__synth_1) ).

cnf(c_0_8,plain,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).

cnf(c_0_9,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

cnf(c_0_10,plain,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).

cnf(c_0_11,plain,
    ( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Message_OMPair__analz_1]) ).

cnf(c_0_12,plain,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).

cnf(c_0_13,plain,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    c_0_8 ).

cnf(c_0_14,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
    cls_conjecture_1 ).

cnf(c_0_15,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
    c_0_9 ).

cnf(c_0_16,plain,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    c_0_10 ).

cnf(c_0_17,plain,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).

cnf(c_0_18,plain,
    ( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
    c_0_11 ).

cnf(c_0_19,plain,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    c_0_12 ).

cnf(c_0_20,plain,
    ( c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Message_OMPair__synth_1]) ).

cnf(c_0_21,negated_conjecture,
    ( c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    ~ c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_23,plain,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    c_0_17 ).

cnf(c_0_24,plain,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X3),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,plain,
    ( c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
    c_0_20 ).

cnf(c_0_26,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    ~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_15,c_0_23]) ).

cnf(c_0_28,plain,
    ( c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OMPair(X1,X4),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_29,negated_conjecture,
    c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    c_in(v_X,c_Message_Oanalz(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SWV245-2 : TPTP v8.2.0. Released v3.2.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun May 19 08:57:38 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/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/benchmark/theBenchmark.p
% 0.19/0.49  # Version: 3.1.0
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30483 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49  # Starting sh5l with 136s (1) cores
% 0.19/0.49  # SAT001_MinMin_p005000_rr_RG with pid 30487 completed with status 0
% 0.19/0.49  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 8
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 8
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 8
% 0.19/0.49  # Processed clauses                    : 56
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 0
% 0.19/0.49  # ...remaining for further processing  : 56
% 0.19/0.49  # Other redundant clauses eliminated   : 0
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 0
% 0.19/0.49  # Backward-rewritten                   : 5
% 0.19/0.49  # Generated clauses                    : 69
% 0.19/0.49  # ...of the previous two non-redundant : 67
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 69
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 0
% 0.19/0.49  # Disequality decompositions           : 0
% 0.19/0.49  # Total rewrite steps                  : 5
% 0.19/0.49  # ...of those cached                   : 0
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 43
% 0.19/0.49  #    Positive orientable unit clauses  : 23
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 5
% 0.19/0.49  #    Non-unit-clauses                  : 15
% 0.19/0.49  # Current number of unprocessed clauses: 23
% 0.19/0.49  # ...number of literals in the above   : 42
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 13
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 52
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 52
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.49  # Unit Clause-clause subsumption calls : 18
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 127
% 0.19/0.49  # BW rewrite match successes           : 5
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 1441
% 0.19/0.49  # Search garbage collected termcells   : 18
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.005 s
% 0.19/0.49  # System time              : 0.003 s
% 0.19/0.49  # Total time               : 0.008 s
% 0.19/0.49  # Maximum resident set size: 1640 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.028 s
% 0.19/0.49  # System time              : 0.010 s
% 0.19/0.49  # Total time               : 0.038 s
% 0.19/0.49  # Maximum resident set size: 1696 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------