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