TSTP Solution File: SEU527_8 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU527_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 19:27:16 EDT 2023
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU527_8 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 09:31:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.ceeictZMwL/E---3.1_8330.p
% 0.22/0.50 # Version: 3.1pre001
% 0.22/0.50 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # new_bool_3 with pid 8448 completed with status 0
% 0.22/0.50 # Result found by new_bool_3
% 0.22/0.50 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FGHSF-FFSS22-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # SAT001_MinMin_p005000_rr_RG with pid 8454 completed with status 0
% 0.22/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHSF-FFSS22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% 0.22/0.51 tff(decl_22, type, in: ($i * $i) > $o).
% 0.22/0.51 tff(decl_23, type, emptyset: $i).
% 0.22/0.51 tff(decl_24, type, setadjoin: ($i * $i) > $i).
% 0.22/0.51 tff(decl_25, type, emptysetE: $o).
% 0.22/0.51 tff(decl_26, type, setadjoinE: $o).
% 0.22/0.51 tff(decl_27, type, esk1_0: $i).
% 0.22/0.51 tff(decl_28, type, esk2_0: $i).
% 0.22/0.51 tff(decl_29, type, esk3_0: $i).
% 0.22/0.51 tff(decl_30, type, epred1_0: $o).
% 0.22/0.51 tff(decl_31, type, esk4_0: $i).
% 0.22/0.51 tff(decl_32, type, esk5_0: $i).
% 0.22/0.51 tff(decl_33, type, esk6_0: $i).
% 0.22/0.51 tff(decl_34, type, epred2_0: $o).
% 0.22/0.51 fof(uniqinunit, conjecture, (emptysetE=>(setadjoinE=>![X1, X4]:((in(X1,setadjoin(X4,emptyset))=>X1=X4)))), file('/export/starexec/sandbox2/tmp/tmp.ceeictZMwL/E---3.1_8330.p', uniqinunit)).
% 0.22/0.51 fof(setadjoinE, axiom, (setadjoinE<=>![X1, X3, X4]:((in(X4,setadjoin(X1,X3))=>![X2:$o]:(((X4=X1=>X2)=>((in(X4,X3)=>X2)=>X2)))))), file('/export/starexec/sandbox2/tmp/tmp.ceeictZMwL/E---3.1_8330.p', setadjoinE)).
% 0.22/0.51 fof(emptysetE, axiom, (emptysetE<=>![X1]:((in(X1,emptyset)=>![X2:$o]:(X2)))), file('/export/starexec/sandbox2/tmp/tmp.ceeictZMwL/E---3.1_8330.p', emptysetE)).
% 0.22/0.51 fof(c_0_3, negated_conjecture, ~((emptysetE=>(setadjoinE=>![X1, X4]:((in(X1,setadjoin(X4,emptyset))=>X1=X4))))), inference(assume_negation,[status(cth)],[uniqinunit])).
% 0.22/0.51 fof(c_0_4, plain, ![X11, X12, X13, X14:$o]:(((((in(X13,X12)|X14|X13=X11|~in(X13,setadjoin(X11,X12))|~setadjoinE)&(~X14|X14|X13=X11|~in(X13,setadjoin(X11,X12))|~setadjoinE))&((in(X13,X12)|X14|~X14|~in(X13,setadjoin(X11,X12))|~setadjoinE)&(~X14|X14|~X14|~in(X13,setadjoin(X11,X12))|~setadjoinE)))&((in(esk6_0,setadjoin(esk4_0,esk5_0))|setadjoinE)&((esk6_0!=esk4_0|epred2_0|setadjoinE)&((~in(esk6_0,esk5_0)|epred2_0|setadjoinE)&(~epred2_0|setadjoinE)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[setadjoinE])])])])])).
% 0.22/0.51 fof(c_0_5, negated_conjecture, (emptysetE&(setadjoinE&(in(esk1_0,setadjoin(esk2_0,emptyset))&esk1_0!=esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
% 0.22/0.51 fof(c_0_6, plain, ![X7, X8:$o]:(((~emptysetE|(~in(X7,emptyset)|X8))&((in(esk3_0,emptyset)|emptysetE)&(~epred1_0|emptysetE)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[emptysetE])])])])])).
% 0.22/0.51 cnf(c_0_7, plain, (in(X1,X3)|X1=X4|~in(X1,setadjoin(X4,X3))|~setadjoinE), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])).
% 0.22/0.51 cnf(c_0_8, negated_conjecture, (setadjoinE), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.51 cnf(c_0_9, plain, (~emptysetE|~in(X1,emptyset)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6])])])).
% 0.22/0.51 cnf(c_0_10, negated_conjecture, (emptysetE), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.51 cnf(c_0_11, plain, (X1=X3|in(X1,X4)|~in(X1,setadjoin(X3,X4))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.22/0.51 cnf(c_0_12, negated_conjecture, (in(esk1_0,setadjoin(esk2_0,emptyset))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.51 cnf(c_0_13, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.22/0.51 cnf(c_0_14, plain, (~in(X1,emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.22/0.51 cnf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13]), c_0_14]), ['proof']).
% 0.22/0.51 # SZS output end CNFRefutation
% 0.22/0.51 # Parsed axioms : 8
% 0.22/0.51 # Removed by relevancy pruning/SinE : 5
% 0.22/0.51 # Initial clauses : 15
% 0.22/0.51 # Removed in clause preprocessing : 3
% 0.22/0.51 # Initial clauses in saturation : 12
% 0.22/0.51 # Processed clauses : 18
% 0.22/0.51 # ...of these trivial : 6
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 12
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 1
% 0.22/0.51 # ...of the previous two non-redundant : 0
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 1
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 8
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 6
% 0.22/0.51 # Positive orientable unit clauses : 3
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 1
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 6
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 702
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.001 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1764 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1676 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------