TSTP Solution File: SEU633_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU633_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:38 EDT 2023
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU633_8 : TPTP v8.1.2. Released v8.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n022.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 2400
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Oct 2 09:30:39 EDT 2023
% 0.12/0.31 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.cYu75y2KIp/E---3.1_15930.p
% 0.17/0.43 # Version: 3.1pre001
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16007 completed with status 0
% 0.17/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FGHNF-FFSS32-SFFFFFNN
% 0.17/0.43 # partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.43 # Starting sh5l with 136s (1) cores
% 0.17/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16012 completed with status 0
% 0.17/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FGHNF-FFSS32-SFFFFFNN
% 0.17/0.43 # partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% 0.17/0.43 tff(decl_22, type, in: ($i * $i) > $o).
% 0.17/0.43 tff(decl_23, type, setunion: $i > $i).
% 0.17/0.43 tff(decl_24, type, setunionE: $o).
% 0.17/0.43 tff(decl_25, type, esk1_3: ($i * $i * $o) > $i).
% 0.17/0.43 tff(decl_26, type, esk2_0: $i).
% 0.17/0.43 tff(decl_27, type, esk3_0: $i).
% 0.17/0.43 tff(decl_28, type, epred1_0: $o).
% 0.17/0.43 tff(decl_29, type, esk4_0: $i).
% 0.17/0.43 tff(decl_30, type, esk5_0: $i).
% 0.17/0.43 fof(setunionE2, conjecture, (setunionE=>![X1, X2]:((in(X2,setunion(X1))=>?[X5]:((in(X5,X1)&in(X2,X5)))))), file('/export/starexec/sandbox/tmp/tmp.cYu75y2KIp/E---3.1_15930.p', setunionE2)).
% 0.17/0.43 fof(setunionE, axiom, (setunionE<=>![X1, X2]:((in(X2,setunion(X1))=>![X3:$o]:((![X4]:((in(X2,X4)=>(in(X4,X1)=>X3)))=>X3))))), file('/export/starexec/sandbox/tmp/tmp.cYu75y2KIp/E---3.1_15930.p', setunionE)).
% 0.17/0.43 fof(c_0_2, negated_conjecture, ~((setunionE=>![X1, X2]:((in(X2,setunion(X1))=>?[X5]:((in(X5,X1)&in(X2,X5))))))), inference(assume_negation,[status(cth)],[setunionE2])).
% 0.17/0.43 fof(c_0_3, plain, ![X6, X7, X8:$o, X13]:((((in(X7,esk1_3(X6,X7,X8))|X8|~in(X7,setunion(X6))|~setunionE)&((in(esk1_3(X6,X7,X8),X6)|X8|~in(X7,setunion(X6))|~setunionE)&(~X8|X8|~in(X7,setunion(X6))|~setunionE)))&((in(esk3_0,setunion(esk2_0))|setunionE)&((~in(esk3_0,X13)|(~in(X13,esk2_0)|epred1_0)|setunionE)&(~epred1_0|setunionE))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[setunionE])])])])])).
% 0.17/0.43 fof(c_0_4, negated_conjecture, ![X16]:((setunionE&(in(esk5_0,setunion(esk4_0))&(~in(X16,esk4_0)|~in(esk5_0,X16))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])).
% 0.17/0.43 cnf(c_0_5, plain, (in(esk1_3(X1,X2,$false),X1)|~in(X2,setunion(X1))|~setunionE), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])])).
% 0.17/0.43 cnf(c_0_6, negated_conjecture, (setunionE), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.17/0.43 cnf(c_0_7, negated_conjecture, (~in(X1,esk4_0)|~in(esk5_0,X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.17/0.43 cnf(c_0_8, plain, (in(esk1_3(X1,X2,$false),X1)|~in(X2,setunion(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])])).
% 0.17/0.43 cnf(c_0_9, plain, (in(X1,esk1_3(X2,X1,$false))|~in(X1,setunion(X2))|~setunionE), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])])).
% 0.17/0.43 cnf(c_0_10, negated_conjecture, (~in(esk5_0,esk1_3(esk4_0,X1,$false))|~in(X1,setunion(esk4_0))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.17/0.43 cnf(c_0_11, plain, (in(X1,esk1_3(X2,X1,$false))|~in(X1,setunion(X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_6])])).
% 0.17/0.43 cnf(c_0_12, negated_conjecture, (in(esk5_0,setunion(esk4_0))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.17/0.43 cnf(c_0_13, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), ['proof']).
% 0.17/0.43 # SZS output end CNFRefutation
% 0.17/0.43 # Parsed axioms : 5
% 0.17/0.43 # Removed by relevancy pruning/SinE : 0
% 0.17/0.43 # Initial clauses : 12
% 0.17/0.43 # Removed in clause preprocessing : 4
% 0.17/0.43 # Initial clauses in saturation : 8
% 0.17/0.43 # Processed clauses : 9
% 0.17/0.43 # ...of these trivial : 3
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 6
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 0
% 0.17/0.43 # Generated clauses : 2
% 0.17/0.43 # ...of the previous two non-redundant : 1
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 2
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Total rewrite steps : 6
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 6
% 0.17/0.43 # Positive orientable unit clauses : 2
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 0
% 0.17/0.43 # Non-unit-clauses : 4
% 0.17/0.43 # Current number of unprocessed clauses: 0
% 0.17/0.43 # ...number of literals in the above : 0
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 0
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 7
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 7
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 0
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 0
% 0.17/0.43 # BW rewrite match successes : 0
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 593
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.003 s
% 0.17/0.43 # System time : 0.001 s
% 0.17/0.43 # Total time : 0.004 s
% 0.17/0.43 # Maximum resident set size: 1760 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.009 s
% 0.17/0.43 # System time : 0.005 s
% 0.17/0.43 # Total time : 0.014 s
% 0.17/0.43 # Maximum resident set size: 1680 pages
% 0.17/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------