TSTP Solution File: SEU519_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU519_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:32:23 EDT 2023
% Result : Theorem 0.23s 0.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : SEU519_8 : TPTP v8.1.2. Released v8.0.0.
% 0.08/0.17 % Command : run_E %s %d THM
% 0.16/0.39 % Computer : n027.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 2400
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Mon Oct 2 09:44:45 EDT 2023
% 0.16/0.39 % CPUTime :
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 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/tmp/tmp.UpiLaDKNps/E---3.1_23219.p
% 0.23/0.51 # Version: 3.1pre001
% 0.23/0.51 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.23/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 # Starting sh5l with 300s (1) cores
% 0.23/0.51 # new_bool_3 with pid 23371 completed with status 0
% 0.23/0.51 # Result found by new_bool_3
% 0.23/0.51 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.23/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.23/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.51 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.23/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.51 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23376 completed with status 0
% 0.23/0.51 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.51 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.52 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.23/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.52 # Preprocessing time : 0.001 s
% 0.23/0.52 # Presaturation interreduction done
% 0.23/0.52
% 0.23/0.52 # Proof found!
% 0.23/0.52 # SZS status Theorem
% 0.23/0.52 # SZS output start CNFRefutation
% 0.23/0.52 tff(decl_22, type, in: ($i * $i) > $o).
% 0.23/0.52 tff(decl_23, type, emptyset: $i).
% 0.23/0.52 tff(decl_24, type, powerset: $i > $i).
% 0.23/0.52 tff(decl_25, type, emptysetE: $o).
% 0.23/0.52 tff(decl_26, type, powersetI: $o).
% 0.23/0.52 tff(decl_27, type, esk1_0: $i).
% 0.23/0.52 tff(decl_28, type, esk2_0: $i).
% 0.23/0.52 tff(decl_29, type, epred1_0: $o).
% 0.23/0.52 tff(decl_30, type, esk3_2: ($i * $i) > $i).
% 0.23/0.52 tff(decl_31, type, esk4_0: $i).
% 0.23/0.52 tff(decl_32, type, esk5_0: $i).
% 0.23/0.52 fof(emptyinPowerset, conjecture, (emptysetE=>(powersetI=>![X3]:(in(emptyset,powerset(X3))))), file('/export/starexec/sandbox2/tmp/tmp.UpiLaDKNps/E---3.1_23219.p', emptyinPowerset)).
% 0.23/0.52 fof(emptysetE, axiom, (emptysetE<=>![X1]:((in(X1,emptyset)=>![X2:$o]:(X2)))), file('/export/starexec/sandbox2/tmp/tmp.UpiLaDKNps/E---3.1_23219.p', emptysetE)).
% 0.23/0.52 fof(powersetI, axiom, (powersetI<=>![X3, X4]:((![X1]:((in(X1,X4)=>in(X1,X3)))=>in(X4,powerset(X3))))), file('/export/starexec/sandbox2/tmp/tmp.UpiLaDKNps/E---3.1_23219.p', powersetI)).
% 0.23/0.52 fof(c_0_3, negated_conjecture, ~((emptysetE=>(powersetI=>![X3]:(in(emptyset,powerset(X3)))))), inference(assume_negation,[status(cth)],[emptyinPowerset])).
% 0.23/0.52 fof(c_0_4, plain, ![X6, X7:$o]:(((~emptysetE|(~in(X6,emptyset)|X7))&((in(esk2_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.23/0.52 fof(c_0_5, negated_conjecture, (emptysetE&(powersetI&~in(emptyset,powerset(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
% 0.23/0.52 fof(c_0_6, plain, ![X10, X11, X15]:((((in(esk3_2(X10,X11),X11)|in(X11,powerset(X10))|~powersetI)&(~in(esk3_2(X10,X11),X10)|in(X11,powerset(X10))|~powersetI))&((~in(X15,esk5_0)|in(X15,esk4_0)|powersetI)&(~in(esk5_0,powerset(esk4_0))|powersetI)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[powersetI])])])])])).
% 0.23/0.52 cnf(c_0_7, plain, (~emptysetE|~in(X1,emptyset)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])).
% 0.23/0.52 cnf(c_0_8, negated_conjecture, (emptysetE), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.23/0.52 cnf(c_0_9, plain, (in(esk3_2(X1,X3),X3)|in(X3,powerset(X1))|~powersetI), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.52 cnf(c_0_10, negated_conjecture, (powersetI), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.23/0.52 cnf(c_0_11, plain, (~in(X1,emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.23/0.52 cnf(c_0_12, plain, (in(esk3_2(X1,X3),X3)|in(X3,powerset(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.23/0.52 cnf(c_0_13, negated_conjecture, (~in(emptyset,powerset(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.23/0.52 cnf(c_0_14, plain, (in(emptyset,powerset(X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.23/0.52 cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']).
% 0.23/0.52 # SZS output end CNFRefutation
% 0.23/0.52 # Parsed axioms : 8
% 0.23/0.52 # Removed by relevancy pruning/SinE : 5
% 0.23/0.52 # Initial clauses : 10
% 0.23/0.52 # Removed in clause preprocessing : 0
% 0.23/0.52 # Initial clauses in saturation : 10
% 0.23/0.52 # Processed clauses : 17
% 0.23/0.52 # ...of these trivial : 4
% 0.23/0.52 # ...subsumed : 0
% 0.23/0.52 # ...remaining for further processing : 13
% 0.23/0.52 # Other redundant clauses eliminated : 0
% 0.23/0.52 # Clauses deleted for lack of memory : 0
% 0.23/0.52 # Backward-subsumed : 0
% 0.23/0.52 # Backward-rewritten : 1
% 0.23/0.52 # Generated clauses : 2
% 0.23/0.52 # ...of the previous two non-redundant : 2
% 0.23/0.52 # ...aggressively subsumed : 0
% 0.23/0.52 # Contextual simplify-reflections : 0
% 0.23/0.52 # Paramodulations : 2
% 0.23/0.52 # Factorizations : 0
% 0.23/0.52 # NegExts : 0
% 0.23/0.52 # Equation resolutions : 0
% 0.23/0.52 # Total rewrite steps : 8
% 0.23/0.52 # Propositional unsat checks : 0
% 0.23/0.52 # Propositional check models : 0
% 0.23/0.52 # Propositional check unsatisfiable : 0
% 0.23/0.52 # Propositional clauses : 0
% 0.23/0.52 # Propositional clauses after purity: 0
% 0.23/0.52 # Propositional unsat core size : 0
% 0.23/0.52 # Propositional preprocessing time : 0.000
% 0.23/0.52 # Propositional encoding time : 0.000
% 0.23/0.52 # Propositional solver time : 0.000
% 0.23/0.52 # Success case prop preproc time : 0.000
% 0.23/0.52 # Success case prop encoding time : 0.000
% 0.23/0.52 # Success case prop solver time : 0.000
% 0.23/0.52 # Current number of processed clauses : 6
% 0.23/0.52 # Positive orientable unit clauses : 3
% 0.23/0.52 # Positive unorientable unit clauses: 0
% 0.23/0.52 # Negative unit clauses : 1
% 0.23/0.52 # Non-unit-clauses : 2
% 0.23/0.52 # Current number of unprocessed clauses: 1
% 0.23/0.52 # ...number of literals in the above : 1
% 0.23/0.52 # Current number of archived formulas : 0
% 0.23/0.52 # Current number of archived clauses : 7
% 0.23/0.52 # Clause-clause subsumption calls (NU) : 2
% 0.23/0.52 # Rec. Clause-clause subsumption calls : 2
% 0.23/0.52 # Non-unit clause-clause subsumptions : 0
% 0.23/0.52 # Unit Clause-clause subsumption calls : 2
% 0.23/0.52 # Rewrite failures with RHS unbound : 0
% 0.23/0.52 # BW rewrite match attempts : 1
% 0.23/0.52 # BW rewrite match successes : 1
% 0.23/0.52 # Condensation attempts : 0
% 0.23/0.52 # Condensation successes : 0
% 0.23/0.52 # Termbank termtop insertions : 540
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.001 s
% 0.23/0.52 # System time : 0.004 s
% 0.23/0.52 # Total time : 0.005 s
% 0.23/0.52 # Maximum resident set size: 1752 pages
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.003 s
% 0.23/0.52 # System time : 0.005 s
% 0.23/0.52 # Total time : 0.008 s
% 0.23/0.52 # Maximum resident set size: 1676 pages
% 0.23/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------