TSTP Solution File: SWW390+1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n006.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:11:12 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    ( ? [X28,X145] : v_P(X28,X145)
   => ? [X308,X309] : 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),X308),v_c),X309)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))) ),
    file('/export/starexec/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p',conj_0) ).

fof(fact_singleton__conv2,axiom,
    ! [X6,X5] : hAPP(c_Set_OCollect(X5),hAPP(c_fequal,X6)) = hAPP(hAPP(c_Set_Oinsert(X5),X6),c_Orderings_Obot__class_Obot(tc_fun(X5,tc_HOL_Obool))),
    file('/export/starexec/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p',fact_singleton__conv2) ).

fof(fact_Collect__def,axiom,
    ! [X23,X5] : hAPP(c_Set_OCollect(X5),X23) = X23,
    file('/export/starexec/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p',fact_Collect__def) ).

fof(fact_empty__def,axiom,
    ! [X5] : c_Orderings_Obot__class_Obot(tc_fun(X5,tc_HOL_Obool)) = hAPP(c_Set_OCollect(X5),hAPP(c_COMBK(tc_HOL_Obool,X5),c_fFalse)),
    file('/export/starexec/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p',fact_empty__def) ).

fof(fact_falseE,axiom,
    ! [X26,X20,X4,X5] : c_Hoare__Mirabelle_Ohoare__derivs(X5,X4,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X5)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(X5),hAPP(c_COMBK(tc_fun(tc_Com_Ostate,tc_HOL_Obool),X5),hAPP(c_COMBK(tc_HOL_Obool,tc_Com_Ostate),c_fFalse))),X20),X26)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(X5),tc_HOL_Obool)))),
    file('/export/starexec/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p',fact_falseE) ).

fof(c_0_5,negated_conjecture,
    ~ ( ? [X28,X145] : v_P(X28,X145)
     => ? [X308,X309] : 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),X308),v_c),X309)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

fof(c_0_6,plain,
    ! [X1298,X1299] : hAPP(c_Set_OCollect(X1299),hAPP(c_fequal,X1298)) = hAPP(hAPP(c_Set_Oinsert(X1299),X1298),c_Orderings_Obot__class_Obot(tc_fun(X1299,tc_HOL_Obool))),
    inference(variable_rename,[status(thm)],[fact_singleton__conv2]) ).

fof(c_0_7,plain,
    ! [X5443,X5444] : hAPP(c_Set_OCollect(X5444),X5443) = X5443,
    inference(variable_rename,[status(thm)],[fact_Collect__def]) ).

fof(c_0_8,plain,
    ! [X1838] : c_Orderings_Obot__class_Obot(tc_fun(X1838,tc_HOL_Obool)) = hAPP(c_Set_OCollect(X1838),hAPP(c_COMBK(tc_HOL_Obool,X1838),c_fFalse)),
    inference(variable_rename,[status(thm)],[fact_empty__def]) ).

fof(c_0_9,negated_conjecture,
    ! [X312,X313] :
      ( v_P(esk1_0,esk2_0)
      & ~ 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),X312),v_c),X313)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

cnf(c_0_10,plain,
    hAPP(c_Set_OCollect(X1),hAPP(c_fequal,X2)) = hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X381,X382,X383,X384] : c_Hoare__Mirabelle_Ohoare__derivs(X384,X383,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X384)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(X384),hAPP(c_COMBK(tc_fun(tc_Com_Ostate,tc_HOL_Obool),X384),hAPP(c_COMBK(tc_HOL_Obool,tc_Com_Ostate),c_fFalse))),X382),X381)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(X384),tc_HOL_Obool)))),
    inference(variable_rename,[status(thm)],[fact_falseE]) ).

cnf(c_0_13,plain,
    c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)) = hAPP(c_Set_OCollect(X1),hAPP(c_COMBK(tc_HOL_Obool,X1),c_fFalse)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ~ 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),X1),v_c),X2)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_fequal,X2),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(X1)),hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(X1),hAPP(c_COMBK(tc_fun(tc_Com_Ostate,tc_HOL_Obool),X1),hAPP(c_COMBK(tc_HOL_Obool,tc_Com_Ostate),c_fFalse))),X3),X4)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(X1),tc_HOL_Obool)))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    hAPP(c_COMBK(tc_HOL_Obool,X1),c_fFalse) = c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)),
    inference(rw,[status(thm)],[c_0_13,c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,v_G,hAPP(c_fequal,hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),X1),v_c),X2))),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,hAPP(c_fequal,hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(X1),hAPP(c_COMBK(tc_fun(tc_Com_Ostate,tc_HOL_Obool),X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Com_Ostate,tc_HOL_Obool)))),X3),X4))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10  % Problem    : SWW390+1 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n006.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 22:22:40 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.96/1.21  Running first-order model finding
% 0.96/1.21  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.7afWYaNCCx/E---3.1_26551.p
% 29.09/5.65  # Version: 3.1pre001
% 29.09/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 29.09/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.65  # Starting new_bool_3 with 300s (1) cores
% 29.09/5.65  # Starting new_bool_1 with 300s (1) cores
% 29.09/5.65  # Starting sh5l with 300s (1) cores
% 29.09/5.65  # sh5l with pid 26635 completed with status 0
% 29.09/5.65  # Result found by sh5l
% 29.09/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 29.09/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.65  # Starting new_bool_3 with 300s (1) cores
% 29.09/5.65  # Starting new_bool_1 with 300s (1) cores
% 29.09/5.65  # Starting sh5l with 300s (1) cores
% 29.09/5.65  # SinE strategy is gf500_gu_R04_F100_L20000
% 29.09/5.65  # Search class: FGHSM-SMLM33-DFFFFFNN
% 29.09/5.65  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.09/5.65  # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 29.09/5.65  # SAT001_MinMin_p005000_rr with pid 26639 completed with status 0
% 29.09/5.65  # Result found by SAT001_MinMin_p005000_rr
% 29.09/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 29.09/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.65  # Starting new_bool_3 with 300s (1) cores
% 29.09/5.65  # Starting new_bool_1 with 300s (1) cores
% 29.09/5.65  # Starting sh5l with 300s (1) cores
% 29.09/5.65  # SinE strategy is gf500_gu_R04_F100_L20000
% 29.09/5.65  # Search class: FGHSM-SMLM33-DFFFFFNN
% 29.09/5.65  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 29.09/5.65  # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 29.09/5.65  # Preprocessing time       : 0.145 s
% 29.09/5.65  # Presaturation interreduction done
% 29.09/5.65  
% 29.09/5.65  # Proof found!
% 29.09/5.65  # SZS status Theorem
% 29.09/5.65  # SZS output start CNFRefutation
% See solution above
% 29.09/5.65  # Parsed axioms                        : 5228
% 29.09/5.65  # Removed by relevancy pruning/SinE    : 734
% 29.09/5.65  # Initial clauses                      : 6567
% 29.09/5.65  # Removed in clause preprocessing      : 166
% 29.09/5.65  # Initial clauses in saturation        : 6401
% 29.09/5.65  # Processed clauses                    : 12601
% 29.09/5.65  # ...of these trivial                  : 224
% 29.09/5.65  # ...subsumed                          : 3331
% 29.09/5.65  # ...remaining for further processing  : 9046
% 29.09/5.65  # Other redundant clauses eliminated   : 516
% 29.09/5.65  # Clauses deleted for lack of memory   : 0
% 29.09/5.65  # Backward-subsumed                    : 83
% 29.09/5.65  # Backward-rewritten                   : 287
% 29.09/5.65  # Generated clauses                    : 32085
% 29.09/5.65  # ...of the previous two non-redundant : 29672
% 29.09/5.65  # ...aggressively subsumed             : 0
% 29.09/5.65  # Contextual simplify-reflections      : 25
% 29.09/5.65  # Paramodulations                      : 31589
% 29.09/5.65  # Factorizations                       : 2
% 29.09/5.65  # NegExts                              : 0
% 29.09/5.65  # Equation resolutions                 : 551
% 29.09/5.65  # Total rewrite steps                  : 12380
% 29.09/5.65  # Propositional unsat checks           : 2
% 29.09/5.65  #    Propositional check models        : 2
% 29.09/5.65  #    Propositional check unsatisfiable : 0
% 29.09/5.65  #    Propositional clauses             : 0
% 29.09/5.65  #    Propositional clauses after purity: 0
% 29.09/5.65  #    Propositional unsat core size     : 0
% 29.09/5.65  #    Propositional preprocessing time  : 0.000
% 29.09/5.65  #    Propositional encoding time       : 0.068
% 29.09/5.65  #    Propositional solver time         : 0.020
% 29.09/5.65  #    Success case prop preproc time    : 0.000
% 29.09/5.65  #    Success case prop encoding time   : 0.000
% 29.09/5.65  #    Success case prop solver time     : 0.000
% 29.09/5.65  # Current number of processed clauses  : 3098
% 29.09/5.65  #    Positive orientable unit clauses  : 946
% 29.09/5.65  #    Positive unorientable unit clauses: 8
% 29.09/5.65  #    Negative unit clauses             : 439
% 29.09/5.65  #    Non-unit-clauses                  : 1705
% 29.09/5.65  # Current number of unprocessed clauses: 26319
% 29.09/5.65  # ...number of literals in the above   : 60456
% 29.09/5.65  # Current number of archived formulas  : 0
% 29.09/5.65  # Current number of archived clauses   : 5530
% 29.09/5.65  # Clause-clause subsumption calls (NU) : 2528911
% 29.09/5.65  # Rec. Clause-clause subsumption calls : 1227500
% 29.09/5.65  # Non-unit clause-clause subsumptions  : 1855
% 29.09/5.65  # Unit Clause-clause subsumption calls : 60247
% 29.09/5.65  # Rewrite failures with RHS unbound    : 323
% 29.09/5.65  # BW rewrite match attempts            : 26601
% 29.09/5.65  # BW rewrite match successes           : 641
% 29.09/5.65  # Condensation attempts                : 0
% 29.09/5.65  # Condensation successes               : 0
% 29.09/5.65  # Termbank termtop insertions          : 1567942
% 29.09/5.65  
% 29.09/5.65  # -------------------------------------------------
% 29.09/5.65  # User time                : 4.045 s
% 29.09/5.65  # System time              : 0.128 s
% 29.09/5.65  # Total time               : 4.172 s
% 29.09/5.65  # Maximum resident set size: 37236 pages
% 29.09/5.65  
% 29.09/5.65  # -------------------------------------------------
% 29.09/5.65  # User time                : 4.180 s
% 29.09/5.65  # System time              : 0.143 s
% 29.09/5.65  # Total time               : 4.323 s
% 29.09/5.65  # Maximum resident set size: 9492 pages
% 29.09/5.65  % E---3.1 exiting
%------------------------------------------------------------------------------