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

View Problem - Process Solution

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

% Computer : n015.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 0.20s 0.63s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  17 unt;   3 nHn;  16 RR)
%            Number of literals    :   33 (   7 equ;  11 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   8 con; 0-3 aty)
%            Number of variables   :   16 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_elem__set_1,axiom,
    hBOOL(c_in(X1,c_Option_Oset(c_Option_Ooption_OSome(X1,X2),X2),X2)),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_elem__set_1) ).

cnf(cls_conjecture_3,negated_conjecture,
    hAPP(c_Com_Obody,v_pn) = c_Option_Ooption_OSome(v_y,tc_Com_Ocom),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_conjecture_3) ).

cnf(cls_set__empty__eq_1,axiom,
    c_Option_Oset(c_Option_Ooption_ONone(X1),X1) = c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_set__empty__eq_1) ).

cnf(cls_WT_OBody_0,axiom,
    ( c_Com_OWT(hAPP(c_Com_Ocom_OBODY,X1))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom) ),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_WT_OBody_0) ).

cnf(cls_MGF_0,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(hAPP(c_Hoare__Mirabelle_OMGT,X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate)
    | ~ c_Com_OWT(X1)
    | ~ c_Com_OWT__bodies
    | ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_MGF_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_Com_OWT__bodies,
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_conjecture_1) ).

cnf(cls_ex__in__conv_0,axiom,
    ~ hBOOL(c_in(X1,c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),X2)),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_ex__in__conv_0) ).

cnf(cls_conjecture_5,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
    file('/export/starexec/sandbox/tmp/tmp.Q5deQkTOAb/E---3.1_2924.p',cls_conjecture_5) ).

cnf(c_0_9,axiom,
    hBOOL(c_in(X1,c_Option_Oset(c_Option_Ooption_OSome(X1,X2),X2),X2)),
    cls_elem__set_1 ).

cnf(c_0_10,negated_conjecture,
    hAPP(c_Com_Obody,v_pn) = c_Option_Ooption_OSome(v_y,tc_Com_Ocom),
    cls_conjecture_3 ).

cnf(c_0_11,axiom,
    c_Option_Oset(c_Option_Ooption_ONone(X1),X1) = c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),
    cls_set__empty__eq_1 ).

cnf(c_0_12,axiom,
    ( c_Com_OWT(hAPP(c_Com_Ocom_OBODY,X1))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom) ),
    cls_WT_OBody_0 ).

cnf(c_0_13,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(hAPP(c_Hoare__Mirabelle_OMGT,X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate)
    | ~ c_Com_OWT(X1)
    | ~ c_Com_OWT__bodies
    | ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
    cls_MGF_0 ).

cnf(c_0_14,negated_conjecture,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    cls_conjecture_0 ).

cnf(c_0_15,negated_conjecture,
    c_Com_OWT__bodies,
    cls_conjecture_1 ).

cnf(c_0_16,negated_conjecture,
    hBOOL(c_in(v_y,c_Option_Oset(hAPP(c_Com_Obody,v_pn),tc_Com_Ocom),tc_Com_Ocom)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_17,plain,
    ( c_Option_Oset(hAPP(c_Com_Obody,X1),tc_Com_Ocom) = c_Orderings_Obot__class_Obot(tc_fun(tc_Com_Ocom,tc_bool))
    | c_Com_OWT(hAPP(c_Com_Ocom_OBODY,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,axiom,
    ~ hBOOL(c_in(X1,c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),X2)),
    cls_ex__in__conv_0 ).

cnf(c_0_19,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
    cls_conjecture_5 ).

cnf(c_0_20,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(hAPP(c_Hoare__Mirabelle_OMGT,X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate)
    | ~ c_Com_OWT(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_21,negated_conjecture,
    c_Com_OWT(hAPP(c_Com_Ocom_OBODY,v_pn)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWV906-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 04:33:31 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.53  Running first-order model finding
% 0.20/0.53  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.Q5deQkTOAb/E---3.1_2924.p
% 0.20/0.63  # Version: 3.1pre001
% 0.20/0.63  # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/0.63  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.63  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.63  # Starting sh5l with 300s (1) cores
% 0.20/0.63  # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 3099 completed with status 0
% 0.20/0.63  # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.20/0.63  # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/0.63  # No SInE strategy applied
% 0.20/0.63  # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.20/0.63  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.63  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.20/0.63  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.20/0.63  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.20/0.63  # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.20/0.63  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 0.20/0.63  # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 3111 completed with status 0
% 0.20/0.63  # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.20/0.63  # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/0.63  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/0.63  # No SInE strategy applied
% 0.20/0.63  # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.20/0.63  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.63  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.20/0.63  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.20/0.63  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.20/0.63  # Preprocessing time       : 0.010 s
% 0.20/0.63  # Presaturation interreduction done
% 0.20/0.63  
% 0.20/0.63  # Proof found!
% 0.20/0.63  # SZS status Unsatisfiable
% 0.20/0.63  # SZS output start CNFRefutation
% See solution above
% 0.20/0.63  # Parsed axioms                        : 514
% 0.20/0.63  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.63  # Initial clauses                      : 514
% 0.20/0.63  # Removed in clause preprocessing      : 3
% 0.20/0.63  # Initial clauses in saturation        : 511
% 0.20/0.63  # Processed clauses                    : 780
% 0.20/0.63  # ...of these trivial                  : 17
% 0.20/0.63  # ...subsumed                          : 107
% 0.20/0.63  # ...remaining for further processing  : 656
% 0.20/0.63  # Other redundant clauses eliminated   : 2
% 0.20/0.63  # Clauses deleted for lack of memory   : 0
% 0.20/0.63  # Backward-subsumed                    : 2
% 0.20/0.63  # Backward-rewritten                   : 5
% 0.20/0.63  # Generated clauses                    : 250
% 0.20/0.63  # ...of the previous two non-redundant : 163
% 0.20/0.63  # ...aggressively subsumed             : 0
% 0.20/0.63  # Contextual simplify-reflections      : 0
% 0.20/0.63  # Paramodulations                      : 240
% 0.20/0.63  # Factorizations                       : 2
% 0.20/0.63  # NegExts                              : 0
% 0.20/0.63  # Equation resolutions                 : 8
% 0.20/0.63  # Total rewrite steps                  : 123
% 0.20/0.63  # Propositional unsat checks           : 0
% 0.20/0.63  #    Propositional check models        : 0
% 0.20/0.63  #    Propositional check unsatisfiable : 0
% 0.20/0.63  #    Propositional clauses             : 0
% 0.20/0.63  #    Propositional clauses after purity: 0
% 0.20/0.63  #    Propositional unsat core size     : 0
% 0.20/0.63  #    Propositional preprocessing time  : 0.000
% 0.20/0.63  #    Propositional encoding time       : 0.000
% 0.20/0.63  #    Propositional solver time         : 0.000
% 0.20/0.63  #    Success case prop preproc time    : 0.000
% 0.20/0.63  #    Success case prop encoding time   : 0.000
% 0.20/0.63  #    Success case prop solver time     : 0.000
% 0.20/0.63  # Current number of processed clauses  : 238
% 0.20/0.63  #    Positive orientable unit clauses  : 114
% 0.20/0.63  #    Positive unorientable unit clauses: 2
% 0.20/0.63  #    Negative unit clauses             : 42
% 0.20/0.63  #    Non-unit-clauses                  : 80
% 0.20/0.63  # Current number of unprocessed clauses: 303
% 0.20/0.63  # ...number of literals in the above   : 658
% 0.20/0.63  # Current number of archived formulas  : 0
% 0.20/0.63  # Current number of archived clauses   : 419
% 0.20/0.63  # Clause-clause subsumption calls (NU) : 20670
% 0.20/0.63  # Rec. Clause-clause subsumption calls : 14562
% 0.20/0.63  # Non-unit clause-clause subsumptions  : 54
% 0.20/0.63  # Unit Clause-clause subsumption calls : 1891
% 0.20/0.63  # Rewrite failures with RHS unbound    : 0
% 0.20/0.63  # BW rewrite match attempts            : 329
% 0.20/0.63  # BW rewrite match successes           : 38
% 0.20/0.63  # Condensation attempts                : 0
% 0.20/0.63  # Condensation successes               : 0
% 0.20/0.63  # Termbank termtop insertions          : 18011
% 0.20/0.63  
% 0.20/0.63  # -------------------------------------------------
% 0.20/0.63  # User time                : 0.070 s
% 0.20/0.63  # System time              : 0.009 s
% 0.20/0.63  # Total time               : 0.079 s
% 0.20/0.63  # Maximum resident set size: 2668 pages
% 0.20/0.63  
% 0.20/0.63  # -------------------------------------------------
% 0.20/0.63  # User time                : 0.327 s
% 0.20/0.63  # System time              : 0.040 s
% 0.20/0.63  # Total time               : 0.368 s
% 0.20/0.63  # Maximum resident set size: 2072 pages
% 0.20/0.63  % E---3.1 exiting
%------------------------------------------------------------------------------