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

View Problem - Process Solution

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

% Computer : n012.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:55:28 EDT 2023

% Result   : Unsatisfiable 4.34s 1.00s
% Output   : CNFRefutation 4.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (   9 unt;   0 nHn;  13 RR)
%            Number of literals    :   37 (   0 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   44 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_weaken_0,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_weaken_0) ).

cnf(cls_subset__insertI2_0,axiom,
    ( c_lessequals(X1,hAPP(hAPP(c_Set_Oinsert(X2),X3),X4),tc_fun(X2,tc_bool))
    | ~ c_lessequals(X1,X4,tc_fun(X2,tc_bool)) ),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_subset__insertI2_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),v_ts),t_a),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_conjecture_0) ).

cnf(cls_equalityE_0,axiom,
    c_lessequals(X1,X1,tc_fun(X2,tc_bool)),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_equalityE_0) ).

cnf(cls_insert__mono_0,axiom,
    ( c_lessequals(hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4),tc_fun(X1,tc_bool))
    | ~ c_lessequals(X3,X4,tc_fun(X1,tc_bool)) ),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_insert__mono_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_conjecture_1) ).

cnf(cls_empty__subsetI_0,axiom,
    c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
    file('/export/starexec/sandbox2/tmp/tmp.SYRN1C4CCD/E---3.1_984.p',cls_empty__subsetI_0) ).

cnf(c_0_7,axiom,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3) ),
    cls_weaken_0 ).

cnf(c_0_8,axiom,
    ( c_lessequals(X1,hAPP(hAPP(c_Set_Oinsert(X2),X3),X4),tc_fun(X2,tc_bool))
    | ~ c_lessequals(X1,X4,tc_fun(X2,tc_bool)) ),
    cls_subset__insertI2_0 ).

cnf(c_0_9,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X3)),X4),X5),X3)
    | ~ c_lessequals(X2,X5,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),v_ts),t_a),
    cls_conjecture_0 ).

cnf(c_0_11,negated_conjecture,
    ( c_Hoare__Mirabelle_Ohoare__derivs(v_G,X1,t_a)
    | ~ c_lessequals(X1,v_ts,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,axiom,
    c_lessequals(X1,X1,tc_fun(X2,tc_bool)),
    cls_equalityE_0 ).

cnf(c_0_13,axiom,
    ( c_lessequals(hAPP(hAPP(c_Set_Oinsert(X1),X2),X3),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4),tc_fun(X1,tc_bool))
    | ~ c_lessequals(X3,X4,tc_fun(X1,tc_bool)) ),
    cls_insert__mono_0 ).

cnf(c_0_14,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
    cls_conjecture_1 ).

cnf(c_0_15,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(v_G,v_ts,t_a),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X2)),X3),X4),X2)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X2)),X3),X5),X2)
    | ~ c_lessequals(X4,X5,tc_fun(tc_Hoare__Mirabelle_Otriple(X2),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    ( c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),X1),t_a)
    | ~ c_lessequals(X1,v_ts,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_10]) ).

cnf(c_0_19,axiom,
    c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
    cls_empty__subsetI_0 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem    : SWV841-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.14  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Oct  3 03:49:05 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  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.SYRN1C4CCD/E---3.1_984.p
% 4.34/0.99  # Version: 3.1pre001
% 4.34/0.99  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.34/0.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/0.99  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.34/0.99  # Starting new_bool_3 with 300s (1) cores
% 4.34/0.99  # Starting new_bool_1 with 300s (1) cores
% 4.34/0.99  # Starting sh5l with 300s (1) cores
% 4.34/0.99  # sh5l with pid 1085 completed with status 0
% 4.34/0.99  # Result found by sh5l
% 4.34/0.99  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.34/0.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/0.99  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.34/0.99  # Starting new_bool_3 with 300s (1) cores
% 4.34/0.99  # Starting new_bool_1 with 300s (1) cores
% 4.34/0.99  # Starting sh5l with 300s (1) cores
% 4.34/0.99  # SinE strategy is gf500_gu_R04_F100_L20000
% 4.34/0.99  # Search class: FGHSM-FSLM32-DFFFFFNN
% 4.34/0.99  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.34/0.99  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 4.34/0.99  # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 1092 completed with status 0
% 4.34/0.99  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 4.34/0.99  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.34/1.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.34/1.00  # Starting new_bool_3 with 300s (1) cores
% 4.34/1.00  # Starting new_bool_1 with 300s (1) cores
% 4.34/1.00  # Starting sh5l with 300s (1) cores
% 4.34/1.00  # SinE strategy is gf500_gu_R04_F100_L20000
% 4.34/1.00  # Search class: FGHSM-FSLM32-DFFFFFNN
% 4.34/1.00  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.34/1.00  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 4.34/1.00  # Preprocessing time       : 0.015 s
% 4.34/1.00  
% 4.34/1.00  # Proof found!
% 4.34/1.00  # SZS status Unsatisfiable
% 4.34/1.00  # SZS output start CNFRefutation
% See solution above
% 4.34/1.00  # Parsed axioms                        : 527
% 4.34/1.00  # Removed by relevancy pruning/SinE    : 123
% 4.34/1.00  # Initial clauses                      : 404
% 4.34/1.00  # Removed in clause preprocessing      : 0
% 4.34/1.00  # Initial clauses in saturation        : 404
% 4.34/1.00  # Processed clauses                    : 1477
% 4.34/1.00  # ...of these trivial                  : 83
% 4.34/1.00  # ...subsumed                          : 701
% 4.34/1.00  # ...remaining for further processing  : 693
% 4.34/1.00  # Other redundant clauses eliminated   : 16
% 4.34/1.00  # Clauses deleted for lack of memory   : 0
% 4.34/1.00  # Backward-subsumed                    : 23
% 4.34/1.00  # Backward-rewritten                   : 6
% 4.34/1.00  # Generated clauses                    : 21235
% 4.34/1.00  # ...of the previous two non-redundant : 19144
% 4.34/1.00  # ...aggressively subsumed             : 0
% 4.34/1.00  # Contextual simplify-reflections      : 0
% 4.34/1.00  # Paramodulations                      : 21204
% 4.34/1.00  # Factorizations                       : 0
% 4.34/1.00  # NegExts                              : 0
% 4.34/1.00  # Equation resolutions                 : 31
% 4.34/1.00  # Total rewrite steps                  : 5292
% 4.34/1.00  # Propositional unsat checks           : 0
% 4.34/1.00  #    Propositional check models        : 0
% 4.34/1.00  #    Propositional check unsatisfiable : 0
% 4.34/1.00  #    Propositional clauses             : 0
% 4.34/1.00  #    Propositional clauses after purity: 0
% 4.34/1.00  #    Propositional unsat core size     : 0
% 4.34/1.00  #    Propositional preprocessing time  : 0.000
% 4.34/1.00  #    Propositional encoding time       : 0.000
% 4.34/1.00  #    Propositional solver time         : 0.000
% 4.34/1.00  #    Success case prop preproc time    : 0.000
% 4.34/1.00  #    Success case prop encoding time   : 0.000
% 4.34/1.00  #    Success case prop solver time     : 0.000
% 4.34/1.00  # Current number of processed clauses  : 664
% 4.34/1.00  #    Positive orientable unit clauses  : 122
% 4.34/1.00  #    Positive unorientable unit clauses: 12
% 4.34/1.00  #    Negative unit clauses             : 9
% 4.34/1.00  #    Non-unit-clauses                  : 521
% 4.34/1.00  # Current number of unprocessed clauses: 18046
% 4.34/1.00  # ...number of literals in the above   : 57370
% 4.34/1.00  # Current number of archived formulas  : 0
% 4.34/1.00  # Current number of archived clauses   : 29
% 4.34/1.00  # Clause-clause subsumption calls (NU) : 38807
% 4.34/1.00  # Rec. Clause-clause subsumption calls : 26883
% 4.34/1.00  # Non-unit clause-clause subsumptions  : 503
% 4.34/1.00  # Unit Clause-clause subsumption calls : 765
% 4.34/1.00  # Rewrite failures with RHS unbound    : 0
% 4.34/1.00  # BW rewrite match attempts            : 1069
% 4.34/1.00  # BW rewrite match successes           : 77
% 4.34/1.00  # Condensation attempts                : 0
% 4.34/1.00  # Condensation successes               : 0
% 4.34/1.00  # Termbank termtop insertions          : 531010
% 4.34/1.00  
% 4.34/1.00  # -------------------------------------------------
% 4.34/1.00  # User time                : 0.504 s
% 4.34/1.00  # System time              : 0.024 s
% 4.34/1.00  # Total time               : 0.527 s
% 4.34/1.00  # Maximum resident set size: 2700 pages
% 4.34/1.00  
% 4.34/1.00  # -------------------------------------------------
% 4.34/1.00  # User time                : 0.512 s
% 4.34/1.00  # System time              : 0.027 s
% 4.34/1.00  # Total time               : 0.538 s
% 4.34/1.00  # Maximum resident set size: 2124 pages
% 4.34/1.00  % E---3.1 exiting
% 4.34/1.00  % E---3.1 exiting
%------------------------------------------------------------------------------