TSTP Solution File: SWW313+1 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : SWW313+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n004.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 : Mon Jun 24 18:11:35 EDT 2024

% Result   : Theorem 1.62s 2.20s
% Output   : CNFRefutation 1.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  10   ~;   7   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_asm,axiom,
    ! [X4,X5,X6] :
      ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X6),tc_HOL_Obool)),X5),X4))
     => c_Hoare__Mirabelle_Ohoare__derivs(X6,X4,X5) ),
    file('/export/starexec/sandbox2/tmp/tmp.DUwb1aj5lE/E---3.1_16308.p',fact_asm) ).

fof(conj_2,conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,v_ts),
    file('/export/starexec/sandbox2/tmp/tmp.DUwb1aj5lE/E---3.1_16308.p',conj_2) ).

fof(fact_cut,axiom,
    ! [X4,X5,X8,X6] :
      ( c_Hoare__Mirabelle_Ohoare__derivs(X6,X8,X5)
     => ( c_Hoare__Mirabelle_Ohoare__derivs(X6,X4,X8)
       => c_Hoare__Mirabelle_Ohoare__derivs(X6,X4,X5) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DUwb1aj5lE/E---3.1_16308.p',fact_cut) ).

fof(conj_1,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_G),v_Ga)),
    file('/export/starexec/sandbox2/tmp/tmp.DUwb1aj5lE/E---3.1_16308.p',conj_1) ).

fof(conj_0,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
    file('/export/starexec/sandbox2/tmp/tmp.DUwb1aj5lE/E---3.1_16308.p',conj_0) ).

fof(c_0_5,plain,
    ! [X399,X400,X401] :
      ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X401),tc_HOL_Obool)),X400),X399))
      | c_Hoare__Mirabelle_Ohoare__derivs(X401,X399,X400) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_asm])])]) ).

fof(c_0_6,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,v_ts),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])]) ).

fof(c_0_7,plain,
    ! [X415,X416,X417,X418] :
      ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X418,X417,X416)
      | ~ c_Hoare__Mirabelle_Ohoare__derivs(X418,X415,X417)
      | c_Hoare__Mirabelle_Ohoare__derivs(X418,X415,X416) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_cut])])]) ).

cnf(c_0_8,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,X3,X2)
    | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X1),tc_HOL_Obool)),X2),X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_G),v_Ga)),
    inference(split_conjunct,[status(thm)],[conj_1]) ).

fof(c_0_10,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,v_ts),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,hypothesis,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,v_G),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
    inference(split_conjunct,[status(thm)],[conj_0]) ).

cnf(c_0_14,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,v_ts),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,hypothesis,
    ( c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_Ga,X1)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_G,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_G,v_ts),
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWW313+1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Jun 19 06:09:39 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 1.37/1.56  Running first-order theorem proving
% 1.37/1.56  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.DUwb1aj5lE/E---3.1_16308.p
% 1.62/2.20  # Version: 3.2.0
% 1.62/2.20  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.62/2.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/2.20  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.62/2.20  # Starting new_bool_3 with 300s (1) cores
% 1.62/2.20  # Starting new_bool_1 with 300s (1) cores
% 1.62/2.20  # Starting sh5l with 300s (1) cores
% 1.62/2.20  # new_bool_3 with pid 16389 completed with status 0
% 1.62/2.20  # Result found by new_bool_3
% 1.62/2.20  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.62/2.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/2.20  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.62/2.20  # Starting new_bool_3 with 300s (1) cores
% 1.62/2.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.62/2.20  # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.62/2.20  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.62/2.20  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.62/2.20  # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 16392 completed with status 0
% 1.62/2.20  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.62/2.20  # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.62/2.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/2.20  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.62/2.20  # Starting new_bool_3 with 300s (1) cores
% 1.62/2.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.62/2.20  # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.62/2.20  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.62/2.20  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.62/2.20  # Preprocessing time       : 0.019 s
% 1.62/2.20  
% 1.62/2.20  # Proof found!
% 1.62/2.20  # SZS status Theorem
% 1.62/2.20  # SZS output start CNFRefutation
% See solution above
% 1.62/2.20  # Parsed axioms                        : 5228
% 1.62/2.20  # Removed by relevancy pruning/SinE    : 4781
% 1.62/2.20  # Initial clauses                      : 663
% 1.62/2.20  # Removed in clause preprocessing      : 31
% 1.62/2.20  # Initial clauses in saturation        : 632
% 1.62/2.20  # Processed clauses                    : 649
% 1.62/2.20  # ...of these trivial                  : 5
% 1.62/2.20  # ...subsumed                          : 119
% 1.62/2.20  # ...remaining for further processing  : 525
% 1.62/2.20  # Other redundant clauses eliminated   : 97
% 1.62/2.20  # Clauses deleted for lack of memory   : 0
% 1.62/2.20  # Backward-subsumed                    : 5
% 1.62/2.20  # Backward-rewritten                   : 6
% 1.62/2.20  # Generated clauses                    : 10814
% 1.62/2.20  # ...of the previous two non-redundant : 9459
% 1.62/2.20  # ...aggressively subsumed             : 0
% 1.62/2.20  # Contextual simplify-reflections      : 4
% 1.62/2.20  # Paramodulations                      : 10690
% 1.62/2.20  # Factorizations                       : 8
% 1.62/2.20  # NegExts                              : 0
% 1.62/2.20  # Equation resolutions                 : 117
% 1.62/2.20  # Disequality decompositions           : 0
% 1.62/2.20  # Total rewrite steps                  : 3383
% 1.62/2.20  # ...of those cached                   : 2395
% 1.62/2.20  # Propositional unsat checks           : 0
% 1.62/2.20  #    Propositional check models        : 0
% 1.62/2.20  #    Propositional check unsatisfiable : 0
% 1.62/2.20  #    Propositional clauses             : 0
% 1.62/2.20  #    Propositional clauses after purity: 0
% 1.62/2.20  #    Propositional unsat core size     : 0
% 1.62/2.20  #    Propositional preprocessing time  : 0.000
% 1.62/2.20  #    Propositional encoding time       : 0.000
% 1.62/2.20  #    Propositional solver time         : 0.000
% 1.62/2.20  #    Success case prop preproc time    : 0.000
% 1.62/2.20  #    Success case prop encoding time   : 0.000
% 1.62/2.20  #    Success case prop solver time     : 0.000
% 1.62/2.20  # Current number of processed clauses  : 491
% 1.62/2.20  #    Positive orientable unit clauses  : 110
% 1.62/2.20  #    Positive unorientable unit clauses: 18
% 1.62/2.20  #    Negative unit clauses             : 11
% 1.62/2.20  #    Non-unit-clauses                  : 352
% 1.62/2.20  # Current number of unprocessed clauses: 9439
% 1.62/2.20  # ...number of literals in the above   : 26258
% 1.62/2.20  # Current number of archived formulas  : 0
% 1.62/2.20  # Current number of archived clauses   : 11
% 1.62/2.20  # Clause-clause subsumption calls (NU) : 20333
% 1.62/2.20  # Rec. Clause-clause subsumption calls : 16258
% 1.62/2.20  # Non-unit clause-clause subsumptions  : 112
% 1.62/2.20  # Unit Clause-clause subsumption calls : 271
% 1.62/2.20  # Rewrite failures with RHS unbound    : 39
% 1.62/2.20  # BW rewrite match attempts            : 1754
% 1.62/2.20  # BW rewrite match successes           : 74
% 1.62/2.20  # Condensation attempts                : 0
% 1.62/2.20  # Condensation successes               : 0
% 1.62/2.20  # Termbank termtop insertions          : 536207
% 1.62/2.20  # Search garbage collected termcells   : 54280
% 1.62/2.20  
% 1.62/2.20  # -------------------------------------------------
% 1.62/2.20  # User time                : 0.379 s
% 1.62/2.20  # System time              : 0.015 s
% 1.62/2.20  # Total time               : 0.394 s
% 1.62/2.20  # Maximum resident set size: 11172 pages
% 1.62/2.20  
% 1.62/2.20  # -------------------------------------------------
% 1.62/2.20  # User time                : 0.614 s
% 1.62/2.20  # System time              : 0.022 s
% 1.62/2.20  # Total time               : 0.636 s
% 1.62/2.20  # Maximum resident set size: 9500 pages
% 1.62/2.20  % E---3.1 exiting
% 1.62/2.21  % E exiting
%------------------------------------------------------------------------------