TSTP Solution File: SEU610_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU610_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:33:51 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.07/0.13 % Problem : SEU610_8 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.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.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 17:39:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 18971 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFSM22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 18976 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFSM22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (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 tff(decl_22, type, in: ($i * $i) > $o).
% 0.20/0.51 tff(decl_23, type, emptyset: $i).
% 0.20/0.51 tff(decl_24, type, emptysetE: $o).
% 0.20/0.51 tff(decl_25, type, in__Cong: $o).
% 0.20/0.51 tff(decl_26, type, subset: ($i * $i) > $o).
% 0.20/0.51 tff(decl_27, type, subsetI2: $o).
% 0.20/0.51 tff(decl_28, type, setminus: ($i * $i) > $i).
% 0.20/0.51 tff(decl_29, type, setminusI: $o).
% 0.20/0.51 tff(decl_30, type, esk1_0: $i).
% 0.20/0.51 tff(decl_31, type, esk2_0: $i).
% 0.20/0.51 tff(decl_32, type, esk3_2: ($i * $i) > $i).
% 0.20/0.51 tff(decl_33, type, esk4_0: $i).
% 0.20/0.51 tff(decl_34, type, esk5_0: $i).
% 0.20/0.51 tff(decl_35, type, esk6_0: $i).
% 0.20/0.51 tff(decl_36, type, epred1_0: $o).
% 0.20/0.51 tff(decl_37, type, esk7_0: $i).
% 0.20/0.51 tff(decl_38, type, esk8_0: $i).
% 0.20/0.51 tff(decl_39, type, esk9_0: $i).
% 0.20/0.51 fof(setminusI, axiom, (setminusI<=>![X3, X4, X1]:((in(X1,X3)=>(~(in(X1,X4))=>in(X1,setminus(X3,X4)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminusI)).
% 0.20/0.51 fof(setminusSubset1, conjecture, (emptysetE=>(in__Cong=>(subsetI2=>(setminusI=>![X3, X4]:((setminus(X3,X4)=emptyset=>subset(X3,X4))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminusSubset1)).
% 0.20/0.51 fof(emptysetE, axiom, (emptysetE<=>![X1]:((in(X1,emptyset)=>![X2:$o]:(X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', emptysetE)).
% 0.20/0.51 fof(subsetI2, axiom, (subsetI2<=>![X3, X4]:((![X1]:((in(X1,X3)=>in(X1,X4)))=>subset(X3,X4)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', subsetI2)).
% 0.20/0.51 fof(c_0_4, plain, (setminusI<=>![X3, X4, X1]:((in(X1,X3)=>(~in(X1,X4)=>in(X1,setminus(X3,X4)))))), inference(fof_simplification,[status(thm)],[setminusI])).
% 0.20/0.51 fof(c_0_5, negated_conjecture, ~((emptysetE=>(in__Cong=>(subsetI2=>(setminusI=>![X3, X4]:((setminus(X3,X4)=emptyset=>subset(X3,X4)))))))), inference(assume_negation,[status(cth)],[setminusSubset1])).
% 0.20/0.51 fof(c_0_6, plain, ![X18, X19, X20]:(((~setminusI|(~in(X20,X18)|(in(X20,X19)|in(X20,setminus(X18,X19)))))&((in(esk9_0,esk7_0)|setminusI)&((~in(esk9_0,esk8_0)|setminusI)&(~in(esk9_0,setminus(esk7_0,esk8_0))|setminusI))))), 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)],[c_0_4])])])])])])).
% 0.20/0.51 fof(c_0_7, negated_conjecture, (emptysetE&(in__Cong&(subsetI2&(setminusI&(setminus(esk1_0,esk2_0)=emptyset&~subset(esk1_0,esk2_0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
% 0.20/0.51 fof(c_0_8, plain, ![X14, X15:$o]:(((~emptysetE|(~in(X14,emptyset)|X15))&((in(esk6_0,emptyset)|emptysetE)&(~epred1_0|emptysetE)))), 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)],[emptysetE])])])])])])).
% 0.20/0.51 fof(c_0_9, plain, ![X8, X9, X13]:((((in(esk3_2(X8,X9),X8)|subset(X8,X9)|~subsetI2)&(~in(esk3_2(X8,X9),X9)|subset(X8,X9)|~subsetI2))&((~in(X13,esk4_0)|in(X13,esk5_0)|subsetI2)&(~subset(esk4_0,esk5_0)|subsetI2)))), 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)],[subsetI2])])])])])])).
% 0.20/0.51 cnf(c_0_10, plain, (in(X1,X4)|in(X1,setminus(X3,X4))|~setminusI|~in(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.20/0.51 cnf(c_0_11, negated_conjecture, (setminusI), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 cnf(c_0_12, plain, (~emptysetE|~in(X1,emptyset)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])])).
% 0.20/0.51 cnf(c_0_13, negated_conjecture, (emptysetE), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 cnf(c_0_14, plain, (subset(X1,X3)|~in(esk3_2(X1,X3),X3)|~subsetI2), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.51 cnf(c_0_15, negated_conjecture, (subsetI2), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 cnf(c_0_16, plain, (in(X1,setminus(X3,X4))|in(X1,X4)|~in(X1,X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
% 0.20/0.51 cnf(c_0_17, negated_conjecture, (setminus(esk1_0,esk2_0)=emptyset), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 cnf(c_0_18, plain, (~in(X1,emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])])).
% 0.20/0.51 cnf(c_0_19, plain, (subset(X1,X3)|~in(esk3_2(X1,X3),X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])])).
% 0.20/0.51 cnf(c_0_20, negated_conjecture, (in(X1,esk2_0)|~in(X1,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
% 0.20/0.51 cnf(c_0_21, plain, (in(esk3_2(X1,X3),X1)|subset(X1,X3)|~subsetI2), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.51 cnf(c_0_22, negated_conjecture, (subset(X1,esk2_0)|~in(esk3_2(X1,esk2_0),esk1_0)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.20/0.51 cnf(c_0_23, plain, (subset(X1,X3)|in(esk3_2(X1,X3),X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_15])])).
% 0.20/0.51 cnf(c_0_24, negated_conjecture, (~subset(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.20/0.51 cnf(c_0_25, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), ['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 : 23
% 0.20/0.51 # Removed in clause preprocessing : 2
% 0.20/0.51 # Initial clauses in saturation : 21
% 0.20/0.51 # Processed clauses : 35
% 0.20/0.51 # ...of these trivial : 11
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 24
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 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 : 6
% 0.20/0.51 # ...of the previous two non-redundant : 5
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 6
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 15
% 0.20/0.51 # ...of those cached : 11
% 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 : 14
% 0.20/0.51 # Positive orientable unit clauses : 7
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 5
% 0.20/0.51 # Current number of unprocessed clauses: 1
% 0.20/0.51 # ...number of literals in the above : 3
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 10
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 5
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 2
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 3
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1387
% 0.20/0.51 # Search garbage collected termcells : 451
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1732 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------