TSTP Solution File: SWW318+1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n023.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 : Tue May 21 06:42:15 EDT 2024

% Result   : Theorem 6.04s 2.13s
% Output   : CNFRefutation 6.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   8   ~;   5   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-2 aty)
%            Number of variables   :   25 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q)),v_G),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

fof(fact_thin,axiom,
    ! [X4,X13,X14,X5] :
      ( c_Hoare__Mirabelle_Ohoare__derivs(X5,X14,X13)
     => ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X5),tc_HOL_Obool)),X14),X4))
       => c_Hoare__Mirabelle_Ohoare__derivs(X5,X4,X13) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_thin) ).

fof(fact_subset__insertI,axiom,
    ! [X6,X113,X5] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X5,tc_HOL_Obool)),X113),hAPP(hAPP(c_Set_Oinsert(X5),X6),X113))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_subset__insertI) ).

fof(conj_0,hypothesis,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

fof(c_0_4,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q)),v_G),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

fof(c_0_5,plain,
    ! [X367,X368,X369,X370] :
      ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X370,X369,X368)
      | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X370),tc_HOL_Obool)),X369),X367))
      | c_Hoare__Mirabelle_Ohoare__derivs(X370,X367,X368) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_thin])])]) ).

fof(c_0_6,plain,
    ! [X520,X521,X522] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X522,tc_HOL_Obool)),X521),hAPP(hAPP(c_Set_Oinsert(X522),X520),X521))),
    inference(variable_rename,[status(thm)],[fact_subset__insertI]) ).

fof(c_0_7,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q)),v_G),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X2),hAPP(hAPP(c_Set_Oinsert(X1),X3),X2))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q)),v_G),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,hypothesis,
    c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    inference(split_conjunct,[status(thm)],[conj_0]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWW318+1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n023.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   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 20:25:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.47  Running first-order theorem proving
% 0.22/0.47  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/benchmark/theBenchmark.p
% 6.04/2.13  # Version: 3.1.0
% 6.04/2.13  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.04/2.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.04/2.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.04/2.13  # Starting new_bool_3 with 300s (1) cores
% 6.04/2.13  # Starting new_bool_1 with 300s (1) cores
% 6.04/2.13  # Starting sh5l with 300s (1) cores
% 6.04/2.13  # new_bool_3 with pid 15774 completed with status 0
% 6.04/2.13  # Result found by new_bool_3
% 6.04/2.13  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.04/2.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.04/2.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.04/2.13  # Starting new_bool_3 with 300s (1) cores
% 6.04/2.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.04/2.13  # Search class: FGHSM-SSLM32-DFFFFFNN
% 6.04/2.13  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.04/2.13  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 6.04/2.13  # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 15777 completed with status 0
% 6.04/2.13  # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 6.04/2.13  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.04/2.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.04/2.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.04/2.13  # Starting new_bool_3 with 300s (1) cores
% 6.04/2.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.04/2.13  # Search class: FGHSM-SSLM32-DFFFFFNN
% 6.04/2.13  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.04/2.13  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 6.04/2.13  # Preprocessing time       : 0.022 s
% 6.04/2.13  # Presaturation interreduction done
% 6.04/2.13  
% 6.04/2.13  # Proof found!
% 6.04/2.13  # SZS status Theorem
% 6.04/2.13  # SZS output start CNFRefutation
% See solution above
% 6.04/2.13  # Parsed axioms                        : 5226
% 6.04/2.13  # Removed by relevancy pruning/SinE    : 4486
% 6.04/2.13  # Initial clauses                      : 1109
% 6.04/2.13  # Removed in clause preprocessing      : 54
% 6.04/2.13  # Initial clauses in saturation        : 1055
% 6.04/2.13  # Processed clauses                    : 6188
% 6.04/2.13  # ...of these trivial                  : 144
% 6.04/2.13  # ...subsumed                          : 3503
% 6.04/2.13  # ...remaining for further processing  : 2541
% 6.04/2.13  # Other redundant clauses eliminated   : 513
% 6.04/2.13  # Clauses deleted for lack of memory   : 0
% 6.04/2.13  # Backward-subsumed                    : 45
% 6.04/2.13  # Backward-rewritten                   : 95
% 6.04/2.13  # Generated clauses                    : 38620
% 6.04/2.13  # ...of the previous two non-redundant : 34850
% 6.04/2.13  # ...aggressively subsumed             : 0
% 6.04/2.13  # Contextual simplify-reflections      : 6
% 6.04/2.13  # Paramodulations                      : 38064
% 6.04/2.13  # Factorizations                       : 8
% 6.04/2.13  # NegExts                              : 0
% 6.04/2.13  # Equation resolutions                 : 560
% 6.04/2.13  # Disequality decompositions           : 0
% 6.04/2.13  # Total rewrite steps                  : 12497
% 6.04/2.13  # ...of those cached                   : 9531
% 6.04/2.13  # Propositional unsat checks           : 0
% 6.04/2.13  #    Propositional check models        : 0
% 6.04/2.13  #    Propositional check unsatisfiable : 0
% 6.04/2.13  #    Propositional clauses             : 0
% 6.04/2.13  #    Propositional clauses after purity: 0
% 6.04/2.13  #    Propositional unsat core size     : 0
% 6.04/2.13  #    Propositional preprocessing time  : 0.000
% 6.04/2.13  #    Propositional encoding time       : 0.000
% 6.04/2.13  #    Propositional solver time         : 0.000
% 6.04/2.13  #    Success case prop preproc time    : 0.000
% 6.04/2.13  #    Success case prop encoding time   : 0.000
% 6.04/2.13  #    Success case prop solver time     : 0.000
% 6.04/2.13  # Current number of processed clauses  : 1591
% 6.04/2.13  #    Positive orientable unit clauses  : 246
% 6.04/2.13  #    Positive unorientable unit clauses: 20
% 6.04/2.13  #    Negative unit clauses             : 185
% 6.04/2.13  #    Non-unit-clauses                  : 1140
% 6.04/2.13  # Current number of unprocessed clauses: 30105
% 6.04/2.13  # ...number of literals in the above   : 81062
% 6.04/2.13  # Current number of archived formulas  : 0
% 6.04/2.13  # Current number of archived clauses   : 869
% 6.04/2.13  # Clause-clause subsumption calls (NU) : 232782
% 6.04/2.13  # Rec. Clause-clause subsumption calls : 159421
% 6.04/2.13  # Non-unit clause-clause subsumptions  : 1973
% 6.04/2.13  # Unit Clause-clause subsumption calls : 18432
% 6.04/2.13  # Rewrite failures with RHS unbound    : 0
% 6.04/2.13  # BW rewrite match attempts            : 6142
% 6.04/2.13  # BW rewrite match successes           : 328
% 6.04/2.13  # Condensation attempts                : 0
% 6.04/2.13  # Condensation successes               : 0
% 6.04/2.13  # Termbank termtop insertions          : 1308272
% 6.04/2.13  # Search garbage collected termcells   : 56785
% 6.04/2.13  
% 6.04/2.13  # -------------------------------------------------
% 6.04/2.13  # User time                : 1.293 s
% 6.04/2.13  # System time              : 0.060 s
% 6.04/2.13  # Total time               : 1.353 s
% 6.04/2.13  # Maximum resident set size: 11804 pages
% 6.04/2.13  
% 6.04/2.13  # -------------------------------------------------
% 6.04/2.13  # User time                : 1.559 s
% 6.04/2.13  # System time              : 0.069 s
% 6.04/2.13  # Total time               : 1.628 s
% 6.04/2.13  # Maximum resident set size: 9412 pages
% 6.04/2.13  % E---3.1 exiting
% 6.04/2.13  % E exiting
%------------------------------------------------------------------------------