TSTP Solution File: SEV434_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEV434_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 04:09:38 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEV434_8 : TPTP v8.2.0. Released v8.0.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 19:12:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4949 completed with status 0
% 0.14/0.40 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.40 # Starting sh5l with 136s (1) cores
% 0.14/0.40 # SAT001_MinMin_p005000_rr_RG with pid 4956 completed with status 0
% 0.14/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% 0.14/0.40 tff(decl_22, type, f: $o > $i).
% 0.14/0.40 tff(decl_23, type, epred1_1: $i > $o).
% 0.14/0.40 tff(decl_24, type, esk1_0: $i).
% 0.14/0.40 tff(decl_25, type, esk2_0: $i).
% 0.14/0.40 tff(decl_26, type, esk3_0: $i).
% 0.14/0.40 fof(fsurj, axiom, ![X1]:(?[X2:$o]:(f(X2)=X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fsurj)).
% 0.14/0.40 fof(less3, conjecture, ![X3, X1, X4]:((X3=X1|X3=X4|X1=X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less3)).
% 0.14/0.40 fof(c_0_2, plain, ![X5]:(((~epred1_1(X5)|f($true)=X5)&(epred1_1(X5)|f($false)=X5))), inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fsurj])])])).
% 0.14/0.40 cnf(c_0_3, plain, (f($true)=X1|~epred1_1(X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.14/0.40 cnf(c_0_4, plain, (epred1_1(X1)|f($false)=X1), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.14/0.40 fof(c_0_5, negated_conjecture, ~(![X3, X1, X4]:((X3=X1|X3=X4|X1=X4))), inference(assume_negation,[status(cth)],[less3])).
% 0.14/0.40 cnf(c_0_6, plain, (f($false)=X1|f($true)=X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
% 0.14/0.40 fof(c_0_7, negated_conjecture, ((esk1_0!=esk2_0&esk1_0!=esk3_0)&esk2_0!=esk3_0), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
% 0.14/0.40 cnf(c_0_8, plain, (f($true)=X1|f($true)=X3|X1=X3), inference(spm,[status(thm)],[c_0_6, c_0_6])).
% 0.14/0.40 cnf(c_0_9, negated_conjecture, (esk1_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.40 cnf(c_0_10, plain, (f($true)=X1|X1=X3|X4=X5|X3=X5|X3=X4), inference(spm,[status(thm)],[c_0_8, c_0_8])).
% 0.14/0.40 cnf(c_0_11, negated_conjecture, (f($true)=X1|esk1_0=X3|esk3_0=X3|X1=esk1_0), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10])])).
% 0.14/0.40 cnf(c_0_12, negated_conjecture, (esk2_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.40 cnf(c_0_13, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.40 cnf(c_0_14, negated_conjecture, (f($true)=esk3_0|f($true)=esk1_0), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]), c_0_9])).
% 0.14/0.40 cnf(c_0_15, negated_conjecture, (f($true)=X1|X1=esk1_0), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_11])]), c_0_13])).
% 0.14/0.40 cnf(c_0_16, negated_conjecture, (X1=esk1_0|X1=esk3_0), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.14/0.40 cnf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_16])]), c_0_13]), ['proof']).
% 0.14/0.40 # SZS output end CNFRefutation
% 0.14/0.40 # Parsed axioms : 3
% 0.14/0.40 # Removed by relevancy pruning/SinE : 0
% 0.14/0.40 # Initial clauses : 6
% 0.14/0.40 # Removed in clause preprocessing : 1
% 0.14/0.40 # Initial clauses in saturation : 5
% 0.14/0.40 # Processed clauses : 31
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 10
% 0.14/0.40 # ...remaining for further processing : 21
% 0.14/0.40 # Other redundant clauses eliminated : 84
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 4
% 0.14/0.40 # Backward-rewritten : 0
% 0.14/0.40 # Generated clauses : 369
% 0.14/0.40 # ...of the previous two non-redundant : 188
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 164
% 0.14/0.40 # Factorizations : 121
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 84
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 0
% 0.14/0.40 # ...of those cached : 0
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 12
% 0.14/0.40 # Positive orientable unit clauses : 0
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 3
% 0.14/0.40 # Non-unit-clauses : 9
% 0.14/0.40 # Current number of unprocessed clauses: 157
% 0.14/0.40 # ...number of literals in the above : 761
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 9
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 24
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 19
% 0.14/0.40 # Non-unit clause-clause subsumptions : 12
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 0
% 0.14/0.40 # BW rewrite match successes : 0
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 730
% 0.14/0.40 # Search garbage collected termcells : 44
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.004 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.007 s
% 0.14/0.40 # Maximum resident set size: 1672 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.019 s
% 0.14/0.40 # System time : 0.009 s
% 0.14/0.40 # Total time : 0.029 s
% 0.14/0.40 # Maximum resident set size: 1692 pages
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------