TSTP Solution File: SEU668^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU668^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 03:28:59 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU668^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:38:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 0.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.51 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.51 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.51 # lpo8_lambda_fix with pid 5837 completed with status 0
% 0.20/0.51 # Result found by lpo8_lambda_fix
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.51 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.51 # Search class: HHUSF-FFSS32-SHSFMSBN
% 0.20/0.51 # partial match(1): HHUSF-FFSF32-SHSFMSBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # new_ho_10 with pid 5841 completed with status 0
% 0.20/0.51 # Result found by new_ho_10
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting new_ho_7 with 300s (1) cores
% 0.20/0.51 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.51 # Search class: HHUSF-FFSS32-SHSFMSBN
% 0.20/0.51 # partial match(1): HHUSF-FFSF32-SHSFMSBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% 0.20/0.51 thf(decl_22, type, in: $i > $i > $o).
% 0.20/0.51 thf(decl_23, type, dsetconstr: $i > ($i > $o) > $i).
% 0.20/0.51 thf(decl_24, type, dsetconstrER: $o).
% 0.20/0.51 thf(decl_25, type, kpair: $i > $i > $i).
% 0.20/0.51 thf(decl_26, type, cartprod: $i > $i > $i).
% 0.20/0.51 thf(decl_27, type, setukpairinjL: $o).
% 0.20/0.51 thf(decl_28, type, setukpairinjR: $o).
% 0.20/0.51 thf(decl_29, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.20/0.51 thf(decl_30, type, esk1_0: $i).
% 0.20/0.51 thf(decl_31, type, esk2_0: $i).
% 0.20/0.51 thf(decl_32, type, epred1_0: $i > $i > $o).
% 0.20/0.51 thf(decl_33, type, esk3_0: $i).
% 0.20/0.51 thf(decl_34, type, esk4_0: $i).
% 0.20/0.51 thf(decl_35, type, epred2_3: ($i > $i > $o) > $i > $i > $i > $o).
% 0.20/0.51 thf(decl_36, type, esk5_4: $i > $i > $i > ($i > $i > $o) > $i).
% 0.20/0.51 thf(decl_37, type, esk6_4: $i > $i > $i > ($i > $i > $o) > $i).
% 0.20/0.51 thf(dsetconstrER, axiom, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(X2 @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrER)).
% 0.20/0.51 thf(dpsetconstrERa, conjecture, ((dsetconstrER)=>((setukpairinjL)=>((setukpairinjR)=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X7)=>((in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X7 @ (^[X5:$i, X6:$i]:((X9 @ X5 @ X6)))))=>(X9 @ X3 @ X4))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstrERa)).
% 0.20/0.51 thf(setukpairinjR, axiom, ((setukpairinjR)<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((((kpair @ X3 @ X4)=(kpair @ X5 @ X6))=>((X4)=(X6))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setukpairinjR)).
% 0.20/0.51 thf(setukpairinjL, axiom, ((setukpairinjL)<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((((kpair @ X3 @ X4)=(kpair @ X5 @ X6))=>((X3)=(X5))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setukpairinjL)).
% 0.20/0.51 thf(dpsetconstr, axiom, ((dpsetconstr)=(^[X1:$i, X7:$i, X8:$i > $i > $o]:(dsetconstr @ (cartprod @ X1 @ X7) @ (^[X6:$i]:(?[X3:$i]:(((in @ X3 @ X1)&?[X4:$i]:((((in @ X4 @ X7)&(X8 @ X3 @ X4))&((X6)=(kpair @ X3 @ X4))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstr)).
% 0.20/0.51 thf(c_0_5, plain, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0)))))=>(X2 @ X3)))), inference(fof_simplification,[status(thm)],[dsetconstrER])).
% 0.20/0.51 thf(c_0_6, negated_conjecture, ~((![X26:$i, X27:$i > $o, X28:$i]:(((in @ X28 @ (dsetconstr @ X26 @ X27))=>(X27 @ X28)))=>(![X29:$i, X30:$i, X31:$i, X32:$i]:((((kpair @ X29 @ X30)=(kpair @ X31 @ X32))=>((X29)=(X31))))=>(![X33:$i, X34:$i, X35:$i, X36:$i]:((((kpair @ X33 @ X34)=(kpair @ X35 @ X36))=>((X34)=(X36))))=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X7)=>((in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X7 @ X9))=>(X9 @ X3 @ X4)))))))))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrERa])]), c_0_5]), setukpairinjR]), setukpairinjL])])).
% 0.20/0.51 thf(c_0_7, negated_conjecture, ![X40:$i, X41:$i > $o, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i, X50:$i]:(((~(in @ X42 @ (dsetconstr @ X40 @ X41))|(X41 @ X42))&((((kpair @ X43 @ X44)!=(kpair @ X45 @ X46))|((X43)=(X45)))&((((kpair @ X47 @ X48)!=(kpair @ X49 @ X50))|((X48)=(X50)))&((in @ esk3_0 @ esk1_0)&((in @ esk4_0 @ esk2_0)&((in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ epred1_0))&~(epred1_0 @ esk3_0 @ esk4_0)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])).
% 0.20/0.51 thf(c_0_8, plain, ![X62:$i, X63:$i, X64:$i, X65:$i > $i > $o, X68:$i, X69:$i]:(((((in @ (esk5_4 @ X62 @ X63 @ X64 @ X65) @ X63)|~(epred2_3 @ X65 @ X64 @ X63 @ X62))&((((in @ (esk6_4 @ X62 @ X63 @ X64 @ X65) @ X64)|~(epred2_3 @ X65 @ X64 @ X63 @ X62))&((X65 @ (esk5_4 @ X62 @ X63 @ X64 @ X65) @ (esk6_4 @ X62 @ X63 @ X64 @ X65))|~(epred2_3 @ X65 @ X64 @ X63 @ X62)))&(((X62)=(kpair @ (esk5_4 @ X62 @ X63 @ X64 @ X65) @ (esk6_4 @ X62 @ X63 @ X64 @ X65)))|~(epred2_3 @ X65 @ X64 @ X63 @ X62))))&(~(in @ X68 @ X63)|(~(in @ X69 @ X64)|~(X65 @ X68 @ X69)|((X62)!=(kpair @ X68 @ X69)))|(epred2_3 @ X65 @ X64 @ X63 @ X62)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])).
% 0.20/0.51 thf(c_0_9, plain, ![X37:$i, X38:$i, X39:$i > $i > $o]:(((dpsetconstr @ X37 @ X38 @ X39)=(dsetconstr @ (cartprod @ X37 @ X38) @ (^[Z0/* 5 */:$i]:(?[X3:$i]:(((in @ X3 @ X37)&?[X4:$i]:((((in @ X4 @ X38)&X39 @ X3 @ X4)&((Z0)=(kpair @ X3 @ X4))))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[dpsetconstr])])).
% 0.20/0.51 thf(c_0_10, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((((X1)=(X4))|((kpair @ X1 @ X3)!=(kpair @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 thf(c_0_11, plain, ![X8:$i > $i > $o, X4:$i, X3:$i, X1:$i]:((((X1)=(kpair @ (esk5_4 @ X1 @ X3 @ X4 @ X8) @ (esk6_4 @ X1 @ X3 @ X4 @ X8)))|~((epred2_3 @ X8 @ X4 @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.20/0.51 thf(c_0_12, plain, ![X56:$i, X57:$i, X58:$i > $i > $o]:(((dpsetconstr @ X56 @ X57 @ X58)=(dsetconstr @ (cartprod @ X56 @ X57) @ (^[Z0/* 5 */:$i]:(?[X3:$i]:(((in @ X3 @ X56)&?[X4:$i]:((((in @ X4 @ X57)&X58 @ X3 @ X4)&((Z0)=(kpair @ X3 @ X4))))))))))), inference(variable_rename,[status(thm)],[c_0_9])).
% 0.20/0.51 thf(c_0_13, plain, ![X61:$i, X1:$i, X3:$i, X8:$i > $i > $o]:(((epred2_3 @ X8 @ X3 @ X1 @ X61)<=>?[X59:$i]:(((in @ X59 @ X1)&?[X60:$i]:((((in @ X60 @ X3)&(X8 @ X59 @ X60))&((X61)=(kpair @ X59 @ X60)))))))), introduced(definition)).
% 0.20/0.51 thf(c_0_14, plain, ![X8:$i > $i > $o, X4:$i, X3:$i, X1:$i]:(((X8 @ (esk5_4 @ X1 @ X3 @ X4 @ X8) @ (esk6_4 @ X1 @ X3 @ X4 @ X8))|~((epred2_3 @ X8 @ X4 @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.20/0.51 thf(c_0_15, negated_conjecture, ![X1:$i, X8:$i > $i > $o, X5:$i, X4:$i, X3:$i]:((((esk5_4 @ (kpair @ X1 @ X3) @ X4 @ X5 @ X8)=(X1))|~((epred2_3 @ X8 @ X5 @ X4 @ (kpair @ X1 @ X3))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11])])).
% 0.20/0.51 thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((((X3)=(X5))|((kpair @ X1 @ X3)!=(kpair @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 thf(c_0_17, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((X2 @ X1)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 thf(c_0_18, plain, ![X8:$i > $i > $o, X3:$i, X1:$i]:(((dpsetconstr @ X1 @ X3 @ X8)=(dsetconstr @ (cartprod @ X1 @ X3) @ (epred2_3 @ X8 @ X3 @ X1)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12]), c_0_13])).
% 0.20/0.51 thf(c_0_19, plain, ![X1:$i, X8:$i > $i > $o, X5:$i, X4:$i, X3:$i]:(((X8 @ X1 @ (esk6_4 @ (kpair @ X1 @ X3) @ X4 @ X5 @ X8))|~((epred2_3 @ X8 @ X5 @ X4 @ (kpair @ X1 @ X3))))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.20/0.51 thf(c_0_20, negated_conjecture, ![X1:$i, X8:$i > $i > $o, X5:$i, X4:$i, X3:$i]:((((esk6_4 @ (kpair @ X1 @ X3) @ X4 @ X5 @ X8)=(X3))|~((epred2_3 @ X8 @ X5 @ X4 @ (kpair @ X1 @ X3))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_11])])).
% 0.20/0.51 thf(c_0_21, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X8:$i > $i > $o]:(((epred2_3 @ X8 @ X1 @ X3 @ X4)|~((in @ X4 @ (dpsetconstr @ X3 @ X1 @ X8))))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.20/0.51 thf(c_0_22, negated_conjecture, (in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ epred1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 thf(c_0_23, negated_conjecture, ![X1:$i, X8:$i > $i > $o, X5:$i, X4:$i, X3:$i]:(((X8 @ X1 @ X3)|~((epred2_3 @ X8 @ X4 @ X5 @ (kpair @ X1 @ X3))))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.20/0.51 thf(c_0_24, negated_conjecture, (epred2_3 @ epred1_0 @ esk2_0 @ esk1_0 @ (kpair @ esk3_0 @ esk4_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.20/0.51 thf(c_0_25, negated_conjecture, ~((epred1_0 @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25]), ['proof']).
% 0.20/0.51 # SZS output end CNFRefutation
% 0.20/0.51 # Parsed axioms : 13
% 0.20/0.51 # Removed by relevancy pruning/SinE : 8
% 0.20/0.51 # Initial clauses : 13
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 13
% 0.20/0.51 # Processed clauses : 46
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 5
% 0.20/0.51 # ...remaining for further processing : 41
% 0.20/0.51 # Other redundant clauses eliminated : 5
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 51
% 0.20/0.51 # ...of the previous two non-redundant : 39
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 44
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 7
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 2
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 27
% 0.20/0.51 # Positive orientable unit clauses : 5
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 21
% 0.20/0.51 # Current number of unprocessed clauses: 18
% 0.20/0.51 # ...number of literals in the above : 56
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 13
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 64
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 27
% 0.20/0.51 # Non-unit clause-clause subsumptions : 5
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 46
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2273
% 0.20/0.51 # Search garbage collected termcells : 564
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.009 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.010 s
% 0.20/0.51 # Maximum resident set size: 1916 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.011 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1732 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------