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

View Problem - Process Solution

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

% Computer : n008.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 20:08:06 EDT 2023

% Result   : Unsatisfiable 266.91s 34.38s
% Output   : CNFRefutation 266.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  14 unt;   3 nHn;   6 RR)
%            Number of literals    :   20 (   8 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-4 aty)
%            Number of variables   :   35 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_empty__def_0,axiom,
    c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)) = c_Collect(c_COMBK(c_False,tc_bool,X1),X1),
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_empty__def_0) ).

cnf(cls_Collect__def_0,axiom,
    c_Collect(X1,X2) = X1,
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_Collect__def_0) ).

cnf(cls_COMBK__def_0,axiom,
    hAPP(c_COMBK(X1,X2,X3),X4) = X1,
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_COMBK__def_0) ).

cnf(cls_escape_0,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(c_Set_Oinsert(c_Hoare__Mirabelle_Otriple_Otriple(X2,X3,X4,t_a),tc_Hoare__Mirabelle_Otriple(t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
    | hBOOL(hAPP(hAPP(X2,v_sko__Hoare__Mirabelle__Xescape__1(X1,X2,X4,X3)),v_sko__Hoare__Mirabelle__Xescape__2(X1,X2,X4,X3))) ),
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_escape_0) ).

cnf(cls_bot1E_0,axiom,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_bot1E_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(c_Set_Oinsert(c_Hoare__Mirabelle_Otriple_Otriple(c_COMBK(c_COMBK(c_False,tc_bool,tc_Com_Ostate),tc_fun(tc_Com_Ostate,tc_bool),t_a),v_c,v_Q,t_a),tc_Hoare__Mirabelle_Otriple(t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
    file('/export/starexec/sandbox/tmp/tmp.LZzMJtOc3o/E---3.1_23171.p',cls_conjecture_0) ).

cnf(c_0_6,axiom,
    c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)) = c_Collect(c_COMBK(c_False,tc_bool,X1),X1),
    cls_empty__def_0 ).

cnf(c_0_7,axiom,
    c_Collect(X1,X2) = X1,
    cls_Collect__def_0 ).

cnf(c_0_8,axiom,
    hAPP(c_COMBK(X1,X2,X3),X4) = X1,
    cls_COMBK__def_0 ).

cnf(c_0_9,plain,
    c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)) = c_COMBK(c_False,tc_bool,X1),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(c_Set_Oinsert(c_Hoare__Mirabelle_Otriple_Otriple(X2,X3,X4,t_a),tc_Hoare__Mirabelle_Otriple(t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
    | hBOOL(hAPP(hAPP(X2,v_sko__Hoare__Mirabelle__Xescape__1(X1,X2,X4,X3)),v_sko__Hoare__Mirabelle__Xescape__2(X1,X2,X4,X3))) ),
    cls_escape_0 ).

cnf(c_0_11,axiom,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    cls_bot1E_0 ).

cnf(c_0_12,plain,
    hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2) = c_False,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(c_Set_Oinsert(c_Hoare__Mirabelle_Otriple_Otriple(c_COMBK(c_COMBK(c_False,tc_bool,tc_Com_Ostate),tc_fun(tc_Com_Ostate,tc_bool),t_a),v_c,v_Q,t_a),tc_Hoare__Mirabelle_Otriple(t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
    cls_conjecture_0 ).

cnf(c_0_14,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(c_Set_Oinsert(c_Hoare__Mirabelle_Otriple_Otriple(c_COMBK(X2,X3,X4),X5,X6,t_a),tc_Hoare__Mirabelle_Otriple(t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a)
    | hBOOL(hAPP(X2,v_sko__Hoare__Mirabelle__Xescape__2(X1,c_COMBK(X2,X3,X4),X6,X5))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_8]) ).

cnf(c_0_15,plain,
    ~ hBOOL(c_False),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]),c_0_9]),c_0_12]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWV909-1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 2400
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Tue Oct  3 04:18:28 EDT 2023
% 0.12/0.35  % CPUTime    : 
% 0.18/0.52  Running first-order model finding
% 0.18/0.52  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.LZzMJtOc3o/E---3.1_23171.p
% 266.91/34.37  # Version: 3.1pre001
% 266.91/34.37  # Preprocessing class: FSLMSMSMSSSNFFN.
% 266.91/34.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 266.91/34.37  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 266.91/34.37  # Starting new_bool_3 with 600s (2) cores
% 266.91/34.37  # Starting new_bool_1 with 300s (1) cores
% 266.91/34.37  # Starting sh5l with 300s (1) cores
% 266.91/34.37  # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 23248 completed with status 0
% 266.91/34.37  # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 266.91/34.37  # Preprocessing class: FSLMSMSMSSSNFFN.
% 266.91/34.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 266.91/34.37  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 266.91/34.37  # No SInE strategy applied
% 266.91/34.37  # Search class: FGHSM-FSLM32-DFFFFFNN
% 266.91/34.37  # Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 266.91/34.37  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 90s (1) cores
% 266.91/34.37  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 266.91/34.37  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 266.91/34.37  # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 266.91/34.38  # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 23257 completed with status 0
% 266.91/34.38  # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 266.91/34.38  # Preprocessing class: FSLMSMSMSSSNFFN.
% 266.91/34.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 266.91/34.38  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 266.91/34.38  # No SInE strategy applied
% 266.91/34.38  # Search class: FGHSM-FSLM32-DFFFFFNN
% 266.91/34.38  # Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 266.91/34.38  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 90s (1) cores
% 266.91/34.38  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 266.91/34.38  # Preprocessing time       : 0.009 s
% 266.91/34.38  # Presaturation interreduction done
% 266.91/34.38  
% 266.91/34.38  # Proof found!
% 266.91/34.38  # SZS status Unsatisfiable
% 266.91/34.38  # SZS output start CNFRefutation
% See solution above
% 266.91/34.38  # Parsed axioms                        : 661
% 266.91/34.38  # Removed by relevancy pruning/SinE    : 0
% 266.91/34.38  # Initial clauses                      : 661
% 266.91/34.38  # Removed in clause preprocessing      : 3
% 266.91/34.38  # Initial clauses in saturation        : 658
% 266.91/34.38  # Processed clauses                    : 60055
% 266.91/34.38  # ...of these trivial                  : 1027
% 266.91/34.38  # ...subsumed                          : 47922
% 266.91/34.38  # ...remaining for further processing  : 11106
% 266.91/34.38  # Other redundant clauses eliminated   : 803
% 266.91/34.38  # Clauses deleted for lack of memory   : 0
% 266.91/34.38  # Backward-subsumed                    : 1229
% 266.91/34.38  # Backward-rewritten                   : 247
% 266.91/34.38  # Generated clauses                    : 1354932
% 266.91/34.38  # ...of the previous two non-redundant : 1292651
% 266.91/34.38  # ...aggressively subsumed             : 0
% 266.91/34.38  # Contextual simplify-reflections      : 28
% 266.91/34.38  # Paramodulations                      : 1353898
% 266.91/34.38  # Factorizations                       : 20
% 266.91/34.38  # NegExts                              : 0
% 266.91/34.38  # Equation resolutions                 : 1014
% 266.91/34.38  # Total rewrite steps                  : 291141
% 266.91/34.38  # Propositional unsat checks           : 0
% 266.91/34.38  #    Propositional check models        : 0
% 266.91/34.38  #    Propositional check unsatisfiable : 0
% 266.91/34.38  #    Propositional clauses             : 0
% 266.91/34.38  #    Propositional clauses after purity: 0
% 266.91/34.38  #    Propositional unsat core size     : 0
% 266.91/34.38  #    Propositional preprocessing time  : 0.000
% 266.91/34.38  #    Propositional encoding time       : 0.000
% 266.91/34.38  #    Propositional solver time         : 0.000
% 266.91/34.38  #    Success case prop preproc time    : 0.000
% 266.91/34.38  #    Success case prop encoding time   : 0.000
% 266.91/34.38  #    Success case prop solver time     : 0.000
% 266.91/34.38  # Current number of processed clauses  : 9107
% 266.91/34.38  #    Positive orientable unit clauses  : 739
% 266.91/34.38  #    Positive unorientable unit clauses: 79
% 266.91/34.38  #    Negative unit clauses             : 366
% 266.91/34.38  #    Non-unit-clauses                  : 7923
% 266.91/34.38  # Current number of unprocessed clauses: 1227778
% 266.91/34.38  # ...number of literals in the above   : 3961460
% 266.91/34.38  # Current number of archived formulas  : 0
% 266.91/34.38  # Current number of archived clauses   : 2002
% 266.91/34.38  # Clause-clause subsumption calls (NU) : 5054281
% 266.91/34.38  # Rec. Clause-clause subsumption calls : 2796746
% 266.91/34.38  # Non-unit clause-clause subsumptions  : 32955
% 266.91/34.38  # Unit Clause-clause subsumption calls : 77935
% 266.91/34.38  # Rewrite failures with RHS unbound    : 108
% 266.91/34.38  # BW rewrite match attempts            : 53824
% 266.91/34.38  # BW rewrite match successes           : 622
% 266.91/34.38  # Condensation attempts                : 0
% 266.91/34.38  # Condensation successes               : 0
% 266.91/34.38  # Termbank termtop insertions          : 35652206
% 266.91/34.38  
% 266.91/34.38  # -------------------------------------------------
% 266.91/34.38  # User time                : 32.411 s
% 266.91/34.38  # System time              : 0.863 s
% 266.91/34.38  # Total time               : 33.274 s
% 266.91/34.38  # Maximum resident set size: 3068 pages
% 266.91/34.38  
% 266.91/34.38  # -------------------------------------------------
% 266.91/34.38  # User time                : 128.826 s
% 266.91/34.38  # System time              : 3.786 s
% 266.91/34.38  # Total time               : 132.612 s
% 266.91/34.38  # Maximum resident set size: 2244 pages
% 266.91/34.38  % E---3.1 exiting
%------------------------------------------------------------------------------