TSTP Solution File: SWW386+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW386+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 : Mon Jun 24 18:11:50 EDT 2024
% Result : Theorem 3.67s 2.07s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 24 unt; 0 def)
% Number of atoms : 52 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 12 |; 0 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 34 ( 3 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_4,conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),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_HOL_Obool)))),
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',conj_4) ).
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.Vftx432L1t/E---3.1_10451.p',fact_singleton__conv2) ).
fof(fact_Collect__def,axiom,
! [X27,X5] : hAPP(c_Set_OCollect(X5),X27) = X27,
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',fact_Collect__def) ).
fof(fact_MGF,axiom,
! [X7] :
( c_Hoare__Mirabelle_Ostate__not__singleton
=> ( c_Com_OWT__bodies
=> ( hBOOL(hAPP(c_Com_OWT,X7))
=> c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X7)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',fact_MGF) ).
fof(fact_option_Osimps_I2_J,axiom,
! [X41,X5] : c_Option_Ooption_ONone(X5) != hAPP(c_Option_Ooption_OSome(X5),X41),
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',fact_option_Osimps_I2_J) ).
fof(fact_WT_OBody,axiom,
! [X12] :
( hAPP(c_Com_Obody,X12) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X12))) ),
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',fact_WT_OBody) ).
fof(conj_0,hypothesis,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',conj_0) ).
fof(conj_1,hypothesis,
c_Com_OWT__bodies,
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',conj_1) ).
fof(conj_3,hypothesis,
hAPP(c_Com_Obody,v_pn) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),v_y),
file('/export/starexec/sandbox2/tmp/tmp.Vftx432L1t/E---3.1_10451.p',conj_3) ).
fof(c_0_9,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),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_HOL_Obool)))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_4])]) ).
fof(c_0_10,plain,
! [X1218,X1219] : hAPP(c_Set_OCollect(X1219),hAPP(c_fequal,X1218)) = hAPP(hAPP(c_Set_Oinsert(X1219),X1218),c_Orderings_Obot__class_Obot(tc_fun(X1219,tc_HOL_Obool))),
inference(variable_rename,[status(thm)],[fact_singleton__conv2]) ).
fof(c_0_11,plain,
! [X3535,X3536] : hAPP(c_Set_OCollect(X3536),X3535) = X3535,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_12,plain,
! [X328] :
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ hBOOL(hAPP(c_Com_OWT,X328))
| c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X328)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_MGF])])]) ).
fof(c_0_13,plain,
! [X41,X5] : c_Option_Ooption_ONone(X5) != hAPP(c_Option_Ooption_OSome(X5),X41),
inference(fof_simplification,[status(thm)],[fact_option_Osimps_I2_J]) ).
fof(c_0_14,plain,
! [X12] :
( hAPP(c_Com_Obody,X12) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X12))) ),
inference(fof_simplification,[status(thm)],[fact_WT_OBody]) ).
fof(c_0_15,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),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_HOL_Obool)))),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_16,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_10]) ).
cnf(c_0_17,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X1)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool))))
| ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
c_Hoare__Mirabelle_Ostate__not__singleton,
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_20,hypothesis,
c_Com_OWT__bodies,
inference(split_conjunct,[status(thm)],[conj_1]) ).
fof(c_0_21,plain,
! [X389,X390] : c_Option_Ooption_ONone(X390) != hAPP(c_Option_Ooption_OSome(X390),X389),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
fof(c_0_22,plain,
! [X349] :
( hAPP(c_Com_Obody,X349) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X349))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_23,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),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_HOL_Obool)))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,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_16,c_0_17]) ).
cnf(c_0_25,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),hAPP(c_Hoare__Mirabelle_OMGT,X1)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool))))
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,plain,
c_Option_Ooption_ONone(X1) != hAPP(c_Option_Ooption_OSome(X1),X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(c_fequal,hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)))),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)),hAPP(c_fequal,hAPP(c_Hoare__Mirabelle_OMGT,X1)))
| ~ hBOOL(hAPP(c_Com_OWT,X1)) ),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,plain,
( hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X1)))
| hAPP(c_Com_Obody,X1) != hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,hypothesis,
hAPP(c_Com_Obody,v_pn) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),v_y),
inference(split_conjunct,[status(thm)],[conj_3]) ).
cnf(c_0_32,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,v_pn))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
( hBOOL(hAPP(c_Com_OWT,hAPP(c_Com_Ocom_OBODY,X1)))
| hAPP(c_Com_Obody,X1) != hAPP(c_Com_Obody,v_pn) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW386+1 : TPTP v8.2.0. Released v5.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 04:26:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.06/1.27 Running first-order theorem proving
% 1.06/1.27 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.Vftx432L1t/E---3.1_10451.p
% 3.67/2.07 # Version: 3.2.0
% 3.67/2.07 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.67/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/2.07 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.67/2.07 # Starting new_bool_3 with 300s (1) cores
% 3.67/2.07 # Starting new_bool_1 with 300s (1) cores
% 3.67/2.07 # Starting sh5l with 300s (1) cores
% 3.67/2.07 # new_bool_3 with pid 10530 completed with status 0
% 3.67/2.07 # Result found by new_bool_3
% 3.67/2.07 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.67/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/2.07 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.67/2.07 # Starting new_bool_3 with 300s (1) cores
% 3.67/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.67/2.07 # Search class: FGHSM-SMLM33-DFFFFFNN
% 3.67/2.07 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.67/2.07 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 3.67/2.07 # SAT001_MinMin_p005000_rr with pid 10534 completed with status 0
% 3.67/2.07 # Result found by SAT001_MinMin_p005000_rr
% 3.67/2.07 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.67/2.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/2.07 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.67/2.07 # Starting new_bool_3 with 300s (1) cores
% 3.67/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.67/2.07 # Search class: FGHSM-SMLM33-DFFFFFNN
% 3.67/2.07 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.67/2.07 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 3.67/2.07 # Preprocessing time : 0.040 s
% 3.67/2.07 # Presaturation interreduction done
% 3.67/2.07
% 3.67/2.07 # Proof found!
% 3.67/2.07 # SZS status Theorem
% 3.67/2.07 # SZS output start CNFRefutation
% See solution above
% 3.67/2.07 # Parsed axioms : 5248
% 3.67/2.07 # Removed by relevancy pruning/SinE : 3533
% 3.67/2.07 # Initial clauses : 2529
% 3.67/2.07 # Removed in clause preprocessing : 84
% 3.67/2.07 # Initial clauses in saturation : 2445
% 3.67/2.07 # Processed clauses : 3180
% 3.67/2.07 # ...of these trivial : 106
% 3.67/2.07 # ...subsumed : 499
% 3.67/2.07 # ...remaining for further processing : 2575
% 3.67/2.07 # Other redundant clauses eliminated : 221
% 3.67/2.07 # Clauses deleted for lack of memory : 0
% 3.67/2.07 # Backward-subsumed : 13
% 3.67/2.07 # Backward-rewritten : 66
% 3.67/2.07 # Generated clauses : 1034
% 3.67/2.07 # ...of the previous two non-redundant : 816
% 3.67/2.07 # ...aggressively subsumed : 0
% 3.67/2.07 # Contextual simplify-reflections : 16
% 3.67/2.07 # Paramodulations : 811
% 3.67/2.07 # Factorizations : 0
% 3.67/2.07 # NegExts : 0
% 3.67/2.07 # Equation resolutions : 247
% 3.67/2.07 # Disequality decompositions : 0
% 3.67/2.07 # Total rewrite steps : 2225
% 3.67/2.07 # ...of those cached : 1597
% 3.67/2.07 # Propositional unsat checks : 0
% 3.67/2.07 # Propositional check models : 0
% 3.67/2.07 # Propositional check unsatisfiable : 0
% 3.67/2.07 # Propositional clauses : 0
% 3.67/2.07 # Propositional clauses after purity: 0
% 3.67/2.07 # Propositional unsat core size : 0
% 3.67/2.07 # Propositional preprocessing time : 0.000
% 3.67/2.07 # Propositional encoding time : 0.000
% 3.67/2.07 # Propositional solver time : 0.000
% 3.67/2.07 # Success case prop preproc time : 0.000
% 3.67/2.07 # Success case prop encoding time : 0.000
% 3.67/2.07 # Success case prop solver time : 0.000
% 3.67/2.07 # Current number of processed clauses : 507
% 3.67/2.07 # Positive orientable unit clauses : 184
% 3.67/2.07 # Positive unorientable unit clauses: 0
% 3.67/2.07 # Negative unit clauses : 75
% 3.67/2.07 # Non-unit-clauses : 248
% 3.67/2.07 # Current number of unprocessed clauses: 1842
% 3.67/2.07 # ...number of literals in the above : 4366
% 3.67/2.07 # Current number of archived formulas : 0
% 3.67/2.07 # Current number of archived clauses : 1890
% 3.67/2.07 # Clause-clause subsumption calls (NU) : 301176
% 3.67/2.07 # Rec. Clause-clause subsumption calls : 173126
% 3.67/2.07 # Non-unit clause-clause subsumptions : 436
% 3.67/2.07 # Unit Clause-clause subsumption calls : 2218
% 3.67/2.07 # Rewrite failures with RHS unbound : 44
% 3.67/2.07 # BW rewrite match attempts : 5637
% 3.67/2.07 # BW rewrite match successes : 220
% 3.67/2.07 # Condensation attempts : 0
% 3.67/2.07 # Condensation successes : 0
% 3.67/2.07 # Termbank termtop insertions : 467742
% 3.67/2.07 # Search garbage collected termcells : 65965
% 3.67/2.07
% 3.67/2.07 # -------------------------------------------------
% 3.67/2.07 # User time : 0.543 s
% 3.67/2.07 # System time : 0.038 s
% 3.67/2.07 # Total time : 0.581 s
% 3.67/2.07 # Maximum resident set size: 17184 pages
% 3.67/2.07
% 3.67/2.07 # -------------------------------------------------
% 3.67/2.07 # User time : 0.739 s
% 3.67/2.07 # System time : 0.046 s
% 3.67/2.07 # Total time : 0.785 s
% 3.67/2.07 # Maximum resident set size: 9568 pages
% 3.67/2.07 % E---3.1 exiting
% 3.67/2.08 % E exiting
%------------------------------------------------------------------------------