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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV272-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:43:58 EDT 2023

% Result   : Unsatisfiable 0.80s 1.18s
% Output   : CNFRefutation 0.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   8 unt;   5 nHn;  17 RR)
%            Number of literals    :   38 (   0 equ;  16 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;   4 con; 0-3 aty)
%            Number of variables   :   40 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OUn__iff_0,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_Set_OUn__iff_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_conjecture_2) ).

cnf(cls_Set_OUn__iff_2,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_Set_OUn__iff_2) ).

cnf(cls_Message_OCrypt__synth_1,axiom,
    ( c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_Message_OCrypt__synth_1) ).

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.UA9TVrWxS3/E---3.1_9878.p',cls_Message_Oparts_OInj_0) ).

cnf(cls_Set_OUn__iff_1,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_Set_OUn__iff_1) ).

cnf(cls_Message_Oparts_OBody_0,axiom,
    ( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.UA9TVrWxS3/E---3.1_9878.p',cls_Message_Oparts_OBody_0) ).

cnf(c_0_8,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    cls_Set_OUn__iff_0 ).

cnf(c_0_9,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    cls_conjecture_1 ).

cnf(c_0_10,negated_conjecture,
    ~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
    cls_conjecture_2 ).

cnf(c_0_11,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUn__iff_2 ).

cnf(c_0_12,axiom,
    ( c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
    cls_Message_OCrypt__synth_1 ).

cnf(c_0_13,negated_conjecture,
    ( c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Oparts(v_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ~ c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,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_16,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUn__iff_1 ).

cnf(c_0_17,axiom,
    ( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
    | ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
    cls_Message_Oparts_OBody_0 ).

cnf(c_0_18,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Oparts(v_H),tc_Message_Omsg),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_10,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.33  % Problem    : SWV272-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.34  % Command    : run_E %s %d THM
% 0.34/0.55  % Computer : n025.cluster.edu
% 0.34/0.55  % Model    : x86_64 x86_64
% 0.34/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.34/0.55  % Memory   : 8042.1875MB
% 0.34/0.55  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.34/0.55  % CPULimit   : 2400
% 0.34/0.55  % WCLimit    : 300
% 0.34/0.55  % DateTime   : Tue Oct  3 04:31:37 EDT 2023
% 0.34/0.55  % CPUTime    : 
% 0.53/0.95  Running first-order theorem proving
% 0.53/0.95  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.UA9TVrWxS3/E---3.1_9878.p
% 0.80/1.18  # Version: 3.1pre001
% 0.80/1.18  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.18  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.18  # Starting new_bool_3 with 300s (1) cores
% 0.80/1.18  # Starting new_bool_1 with 300s (1) cores
% 0.80/1.18  # Starting sh5l with 300s (1) cores
% 0.80/1.18  # new_bool_1 with pid 9968 completed with status 0
% 0.80/1.18  # Result found by new_bool_1
% 0.80/1.18  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.18  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.18  # Starting new_bool_3 with 300s (1) cores
% 0.80/1.18  # Starting new_bool_1 with 300s (1) cores
% 0.80/1.18  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/1.18  # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.80/1.18  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.80/1.18  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.80/1.18  # G-E--_303_C18_F1_URBAN_S0Y with pid 9971 completed with status 0
% 0.80/1.18  # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.80/1.18  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.18  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.18  # Starting new_bool_3 with 300s (1) cores
% 0.80/1.18  # Starting new_bool_1 with 300s (1) cores
% 0.80/1.18  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/1.18  # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.80/1.18  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.80/1.18  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.80/1.18  # Preprocessing time       : 0.019 s
% 0.80/1.18  
% 0.80/1.18  # Proof found!
% 0.80/1.18  # SZS status Unsatisfiable
% 0.80/1.18  # SZS output start CNFRefutation
% See solution above
% 0.80/1.18  # Parsed axioms                        : 2828
% 0.80/1.18  # Removed by relevancy pruning/SinE    : 2248
% 0.80/1.18  # Initial clauses                      : 580
% 0.80/1.18  # Removed in clause preprocessing      : 0
% 0.80/1.18  # Initial clauses in saturation        : 580
% 0.80/1.18  # Processed clauses                    : 645
% 0.80/1.18  # ...of these trivial                  : 17
% 0.80/1.18  # ...subsumed                          : 88
% 0.80/1.18  # ...remaining for further processing  : 540
% 0.80/1.18  # Other redundant clauses eliminated   : 0
% 0.80/1.18  # Clauses deleted for lack of memory   : 0
% 0.80/1.18  # Backward-subsumed                    : 3
% 0.80/1.18  # Backward-rewritten                   : 7
% 0.80/1.18  # Generated clauses                    : 3527
% 0.80/1.18  # ...of the previous two non-redundant : 2699
% 0.80/1.18  # ...aggressively subsumed             : 0
% 0.80/1.18  # Contextual simplify-reflections      : 2
% 0.80/1.18  # Paramodulations                      : 3501
% 0.80/1.18  # Factorizations                       : 0
% 0.80/1.18  # NegExts                              : 0
% 0.80/1.18  # Equation resolutions                 : 26
% 0.80/1.18  # Total rewrite steps                  : 1133
% 0.80/1.18  # Propositional unsat checks           : 0
% 0.80/1.18  #    Propositional check models        : 0
% 0.80/1.18  #    Propositional check unsatisfiable : 0
% 0.80/1.18  #    Propositional clauses             : 0
% 0.80/1.18  #    Propositional clauses after purity: 0
% 0.80/1.18  #    Propositional unsat core size     : 0
% 0.80/1.18  #    Propositional preprocessing time  : 0.000
% 0.80/1.18  #    Propositional encoding time       : 0.000
% 0.80/1.18  #    Propositional solver time         : 0.000
% 0.80/1.18  #    Success case prop preproc time    : 0.000
% 0.80/1.18  #    Success case prop encoding time   : 0.000
% 0.80/1.18  #    Success case prop solver time     : 0.000
% 0.80/1.18  # Current number of processed clauses  : 530
% 0.80/1.18  #    Positive orientable unit clauses  : 107
% 0.80/1.18  #    Positive unorientable unit clauses: 2
% 0.80/1.18  #    Negative unit clauses             : 19
% 0.80/1.18  #    Non-unit-clauses                  : 402
% 0.80/1.18  # Current number of unprocessed clauses: 2631
% 0.80/1.18  # ...number of literals in the above   : 10196
% 0.80/1.18  # Current number of archived formulas  : 0
% 0.80/1.18  # Current number of archived clauses   : 10
% 0.80/1.18  # Clause-clause subsumption calls (NU) : 62884
% 0.80/1.18  # Rec. Clause-clause subsumption calls : 15288
% 0.80/1.18  # Non-unit clause-clause subsumptions  : 59
% 0.80/1.18  # Unit Clause-clause subsumption calls : 857
% 0.80/1.18  # Rewrite failures with RHS unbound    : 0
% 0.80/1.18  # BW rewrite match attempts            : 39
% 0.80/1.18  # BW rewrite match successes           : 7
% 0.80/1.18  # Condensation attempts                : 0
% 0.80/1.18  # Condensation successes               : 0
% 0.80/1.18  # Termbank termtop insertions          : 94222
% 0.80/1.18  
% 0.80/1.18  # -------------------------------------------------
% 0.80/1.18  # User time                : 0.150 s
% 0.80/1.18  # System time              : 0.009 s
% 0.80/1.18  # Total time               : 0.159 s
% 0.80/1.18  # Maximum resident set size: 4524 pages
% 0.80/1.18  
% 0.80/1.18  # -------------------------------------------------
% 0.80/1.18  # User time                : 0.206 s
% 0.80/1.18  # System time              : 0.010 s
% 0.80/1.18  # Total time               : 0.215 s
% 0.80/1.18  # Maximum resident set size: 3536 pages
% 0.80/1.18  % E---3.1 exiting
% 0.80/1.18  % E---3.1 exiting
%------------------------------------------------------------------------------