0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n013.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Wed Jul 14 13:54:18 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.47 Running first-order theorem proving 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.47 # Version: 2.6 0.19/0.47 # No SInE strategy applied 0.19/0.47 # Trying AutoSched0 for 59 seconds 0.51/0.68 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_S0Y 0.51/0.68 # and selection function SelectMaxLComplexAvoidPosPred. 0.51/0.68 # 0.51/0.68 # Preprocessing time : 0.044 s 0.51/0.68 0.51/0.68 # Proof found! 0.51/0.68 # SZS status Theorem 0.51/0.68 # SZS output start CNFRefutation 0.51/0.68 fof(quaternion_ds1_inuse_0010, conjecture, ((((((((((((((((((((((((((((((((use=a_select2(rho_defuse,n1)&a_select2(rho_defuse,n2)=use)&use=a_select2(sigma_defuse,n0))&use=a_select2(sigma_defuse,n1))&use=a_select2(sigma_defuse,n4))&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&use=a_select2(xinit_defuse,n3))&a_select2(xinit_defuse,n4)=use)&use=a_select2(xinit_defuse,n5))&use=a_select2(xinit_mean_defuse,n1))&use=a_select2(xinit_mean_defuse,n4))&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&leq(pv5,n998))&![X14, X16]:(use=a_select3(z_defuse,X14,X16)<=(((leq(X14,n2)&leq(X16,pred(pv5)))&leq(n0,X16))&leq(n0,X14))))&![X6, X7]:((((leq(X6,n2)&leq(X7,pred(pv5)))&leq(n0,X7))&leq(n0,X6))=>use=a_select3(u_defuse,X6,X7)))&leq(pv5,n0))&leq(n0,pv5))&a_select2(xinit_noise_defuse,n5)=use)&use=a_select2(xinit_noise_defuse,n4))&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n2)=use)&use=a_select2(xinit_noise_defuse,n1))&a_select2(xinit_mean_defuse,n3)=use)&use=a_select2(xinit_mean_defuse,n2))&use=a_select2(xinit_mean_defuse,n0))&a_select3(u_defuse,n2,n0)=use)&a_select2(sigma_defuse,n5)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(rho_defuse,n0)=use)=>![X17, X18]:((((~((n0=X17&X18=pv5))&~((X18=pv5&n2=X17)))&~((pv5=X18&X17=n1)))=>a_select3(z_defuse,X17,X18)=use)<=(((leq(n0,X17)&leq(n0,X18))&leq(X18,pv5))&leq(X17,n2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', quaternion_ds1_inuse_0010)). 0.51/0.68 fof(finite_domain_0, axiom, ![X1]:(n0=X1<=(leq(n0,X1)&leq(X1,n0))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', finite_domain_0)). 0.51/0.68 fof(finite_domain_2, axiom, ![X1]:((n0=X1|n1=X1|X1=n2)<=(leq(X1,n2)&leq(n0,X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', finite_domain_2)). 0.51/0.68 fof(c_0_3, plain, (epred2_0<=>(((((((((((((((((((((((((((((((use=a_select2(rho_defuse,n1)&a_select2(rho_defuse,n2)=use)&use=a_select2(sigma_defuse,n0))&use=a_select2(sigma_defuse,n1))&use=a_select2(sigma_defuse,n4))&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&use=a_select2(xinit_defuse,n3))&a_select2(xinit_defuse,n4)=use)&use=a_select2(xinit_defuse,n5))&use=a_select2(xinit_mean_defuse,n1))&use=a_select2(xinit_mean_defuse,n4))&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&leq(pv5,n998))&![X14, X16]:((((leq(X14,n2)&leq(X16,pred(pv5)))&leq(n0,X16))&leq(n0,X14))=>use=a_select3(z_defuse,X14,X16)))&![X6, X7]:((((leq(X6,n2)&leq(X7,pred(pv5)))&leq(n0,X7))&leq(n0,X6))=>use=a_select3(u_defuse,X6,X7)))&leq(pv5,n0))&leq(n0,pv5))&a_select2(xinit_noise_defuse,n5)=use)&use=a_select2(xinit_noise_defuse,n4))&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n2)=use)&use=a_select2(xinit_noise_defuse,n1))&a_select2(xinit_mean_defuse,n3)=use)&use=a_select2(xinit_mean_defuse,n2))&use=a_select2(xinit_mean_defuse,n0))&a_select3(u_defuse,n2,n0)=use)&a_select2(sigma_defuse,n5)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(rho_defuse,n0)=use)), introduced(definition)). 0.51/0.68 fof(c_0_4, plain, (epred2_0=>(((((((((((((((((((((((((((((((use=a_select2(rho_defuse,n1)&a_select2(rho_defuse,n2)=use)&use=a_select2(sigma_defuse,n0))&use=a_select2(sigma_defuse,n1))&use=a_select2(sigma_defuse,n4))&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&use=a_select2(xinit_defuse,n3))&a_select2(xinit_defuse,n4)=use)&use=a_select2(xinit_defuse,n5))&use=a_select2(xinit_mean_defuse,n1))&use=a_select2(xinit_mean_defuse,n4))&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&leq(pv5,n998))&![X14, X16]:((((leq(X14,n2)&leq(X16,pred(pv5)))&leq(n0,X16))&leq(n0,X14))=>use=a_select3(z_defuse,X14,X16)))&![X6, X7]:((((leq(X6,n2)&leq(X7,pred(pv5)))&leq(n0,X7))&leq(n0,X6))=>use=a_select3(u_defuse,X6,X7)))&leq(pv5,n0))&leq(n0,pv5))&a_select2(xinit_noise_defuse,n5)=use)&use=a_select2(xinit_noise_defuse,n4))&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n2)=use)&use=a_select2(xinit_noise_defuse,n1))&a_select2(xinit_mean_defuse,n3)=use)&use=a_select2(xinit_mean_defuse,n2))&use=a_select2(xinit_mean_defuse,n0))&a_select3(u_defuse,n2,n0)=use)&a_select2(sigma_defuse,n5)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(rho_defuse,n0)=use)), inference(split_equiv,[status(thm)],[c_0_3])). 0.51/0.68 fof(c_0_5, negated_conjecture, ~((epred2_0=>![X17, X18]:((((leq(n0,X17)&leq(n0,X18))&leq(X18,pv5))&leq(X17,n2))=>(((~((n0=X17&X18=pv5))&~((X18=pv5&n2=X17)))&~((pv5=X18&X17=n1)))=>a_select3(z_defuse,X17,X18)=use)))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0010])]), c_0_3])). 0.51/0.68 fof(c_0_6, plain, ![X1]:((leq(n0,X1)&leq(X1,n0))=>n0=X1), inference(fof_simplification,[status(thm)],[finite_domain_0])). 0.51/0.68 fof(c_0_7, plain, ![X375, X376, X377, X378]:((((((((((((((((((((((((((((((((use=a_select2(rho_defuse,n1)|~epred2_0)&(a_select2(rho_defuse,n2)=use|~epred2_0))&(use=a_select2(sigma_defuse,n0)|~epred2_0))&(use=a_select2(sigma_defuse,n1)|~epred2_0))&(use=a_select2(sigma_defuse,n4)|~epred2_0))&(a_select3(u_defuse,n0,n0)=use|~epred2_0))&(a_select3(u_defuse,n1,n0)=use|~epred2_0))&(use=a_select2(xinit_defuse,n3)|~epred2_0))&(a_select2(xinit_defuse,n4)=use|~epred2_0))&(use=a_select2(xinit_defuse,n5)|~epred2_0))&(use=a_select2(xinit_mean_defuse,n1)|~epred2_0))&(use=a_select2(xinit_mean_defuse,n4)|~epred2_0))&(a_select2(xinit_mean_defuse,n5)=use|~epred2_0))&(a_select2(xinit_noise_defuse,n0)=use|~epred2_0))&(leq(pv5,n998)|~epred2_0))&(~leq(X375,n2)|~leq(X376,pred(pv5))|~leq(n0,X376)|~leq(n0,X375)|use=a_select3(z_defuse,X375,X376)|~epred2_0))&(~leq(X377,n2)|~leq(X378,pred(pv5))|~leq(n0,X378)|~leq(n0,X377)|use=a_select3(u_defuse,X377,X378)|~epred2_0))&(leq(pv5,n0)|~epred2_0))&(leq(n0,pv5)|~epred2_0))&(a_select2(xinit_noise_defuse,n5)=use|~epred2_0))&(use=a_select2(xinit_noise_defuse,n4)|~epred2_0))&(a_select2(xinit_noise_defuse,n3)=use|~epred2_0))&(a_select2(xinit_noise_defuse,n2)=use|~epred2_0))&(use=a_select2(xinit_noise_defuse,n1)|~epred2_0))&(a_select2(xinit_mean_defuse,n3)=use|~epred2_0))&(use=a_select2(xinit_mean_defuse,n2)|~epred2_0))&(use=a_select2(xinit_mean_defuse,n0)|~epred2_0))&(a_select3(u_defuse,n2,n0)=use|~epred2_0))&(a_select2(sigma_defuse,n5)=use|~epred2_0))&(a_select2(sigma_defuse,n3)=use|~epred2_0))&(a_select2(sigma_defuse,n2)=use|~epred2_0))&(a_select2(rho_defuse,n0)=use|~epred2_0)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 0.51/0.68 fof(c_0_8, negated_conjecture, (epred2_0&((((leq(n0,esk24_0)&leq(n0,esk25_0))&leq(esk25_0,pv5))&leq(esk24_0,n2))&((((n0!=esk24_0|esk25_0!=pv5)&(esk25_0!=pv5|n2!=esk24_0))&(pv5!=esk25_0|esk24_0!=n1))&a_select3(z_defuse,esk24_0,esk25_0)!=use))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])). 0.51/0.68 fof(c_0_9, plain, ![X365]:(~leq(n0,X365)|~leq(X365,n0)|n0=X365), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])). 0.51/0.68 cnf(c_0_10, plain, (leq(pv5,n0)|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_7])). 0.51/0.68 cnf(c_0_11, negated_conjecture, (epred2_0), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_12, plain, (leq(n0,pv5)|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_7])). 0.51/0.68 cnf(c_0_13, plain, (n0=X1|~leq(n0,X1)|~leq(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.51/0.68 cnf(c_0_14, plain, (leq(pv5,n0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])). 0.51/0.68 cnf(c_0_15, plain, (leq(n0,pv5)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_11])])). 0.51/0.68 fof(c_0_16, plain, ![X1]:((leq(X1,n2)&leq(n0,X1))=>(n0=X1|n1=X1|X1=n2)), inference(fof_simplification,[status(thm)],[finite_domain_2])). 0.51/0.68 cnf(c_0_17, negated_conjecture, (leq(esk25_0,pv5)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_18, plain, (pv5=n0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])])). 0.51/0.68 fof(c_0_19, plain, ![X360]:(~leq(X360,n2)|~leq(n0,X360)|(n0=X360|n1=X360|X360=n2)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])). 0.51/0.68 cnf(c_0_20, negated_conjecture, (n0!=esk24_0|esk25_0!=pv5), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_21, negated_conjecture, (leq(esk25_0,n0)), inference(rw,[status(thm)],[c_0_17, c_0_18])). 0.51/0.68 cnf(c_0_22, negated_conjecture, (leq(n0,esk25_0)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_23, plain, (n0=X1|n1=X1|X1=n2|~leq(X1,n2)|~leq(n0,X1)), inference(split_conjunct,[status(thm)],[c_0_19])). 0.51/0.68 cnf(c_0_24, negated_conjecture, (leq(esk24_0,n2)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_25, negated_conjecture, (leq(n0,esk24_0)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_26, negated_conjecture, (esk24_0!=n0|esk25_0!=n0), inference(rw,[status(thm)],[c_0_20, c_0_18])). 0.51/0.68 cnf(c_0_27, negated_conjecture, (esk25_0=n0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_21]), c_0_22])])). 0.51/0.68 cnf(c_0_28, negated_conjecture, (pv5!=esk25_0|esk24_0!=n1), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_29, negated_conjecture, (esk24_0=n2|esk24_0=n0|esk24_0=n1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])). 0.51/0.68 cnf(c_0_30, negated_conjecture, (esk24_0!=n0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])])). 0.51/0.68 cnf(c_0_31, negated_conjecture, (esk24_0!=n1|esk25_0!=n0), inference(rw,[status(thm)],[c_0_28, c_0_18])). 0.51/0.68 cnf(c_0_32, negated_conjecture, (esk25_0!=pv5|n2!=esk24_0), inference(split_conjunct,[status(thm)],[c_0_8])). 0.51/0.68 cnf(c_0_33, negated_conjecture, (esk24_0=n1|esk24_0=n2), inference(sr,[status(thm)],[c_0_29, c_0_30])). 0.51/0.68 cnf(c_0_34, negated_conjecture, (esk24_0!=n1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_27])])). 0.51/0.68 cnf(c_0_35, negated_conjecture, (esk24_0!=n2|esk25_0!=n0), inference(rw,[status(thm)],[c_0_32, c_0_18])). 0.51/0.68 cnf(c_0_36, negated_conjecture, (esk24_0=n2), inference(sr,[status(thm)],[c_0_33, c_0_34])). 0.51/0.68 cnf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_27])]), c_0_36])]), ['proof']). 0.51/0.68 # SZS output end CNFRefutation 0.51/0.68 # Proof object total steps : 38 0.51/0.68 # Proof object clause steps : 26 0.51/0.68 # Proof object formula steps : 12 0.51/0.68 # Proof object conjectures : 22 0.51/0.68 # Proof object clause conjectures : 19 0.51/0.68 # Proof object formula conjectures : 3 0.51/0.68 # Proof object initial clauses used : 12 0.51/0.68 # Proof object initial formulas used : 3 0.51/0.68 # Proof object generating inferences : 3 0.51/0.68 # Proof object simplifying inferences : 24 0.51/0.68 # Training examples: 0 positive, 0 negative 0.51/0.68 # Parsed axioms : 92 0.51/0.68 # Removed by relevancy pruning/SinE : 0 0.51/0.68 # Initial clauses : 240 0.51/0.68 # Removed in clause preprocessing : 2 0.51/0.68 # Initial clauses in saturation : 238 0.51/0.68 # Processed clauses : 315 0.51/0.68 # ...of these trivial : 1 0.51/0.68 # ...subsumed : 15 0.51/0.68 # ...remaining for further processing : 298 0.51/0.68 # Other redundant clauses eliminated : 9 0.51/0.68 # Clauses deleted for lack of memory : 0 0.51/0.68 # Backward-subsumed : 2 0.51/0.68 # Backward-rewritten : 28 0.51/0.68 # Generated clauses : 4581 0.51/0.68 # ...of the previous two non-trivial : 4537 0.51/0.68 # Contextual simplify-reflections : 0 0.51/0.68 # Paramodulations : 4561 0.51/0.68 # Factorizations : 7 0.51/0.68 # NegExts : 0 0.51/0.68 # Equation resolutions : 11 0.51/0.68 # Propositional unsat checks : 0 0.51/0.68 # Propositional check models : 0 0.51/0.68 # Propositional check unsatisfiable : 0 0.51/0.68 # Propositional clauses : 0 0.51/0.68 # Propositional clauses after purity: 0 0.51/0.68 # Propositional unsat core size : 0 0.51/0.68 # Propositional preprocessing time : 0.000 0.51/0.68 # Propositional encoding time : 0.000 0.51/0.68 # Propositional solver time : 0.000 0.51/0.68 # Success case prop preproc time : 0.000 0.51/0.68 # Success case prop encoding time : 0.000 0.51/0.68 # Success case prop solver time : 0.000 0.51/0.68 # Current number of processed clauses : 265 0.51/0.68 # Positive orientable unit clauses : 92 0.51/0.68 # Positive unorientable unit clauses: 5 0.51/0.68 # Negative unit clauses : 13 0.51/0.68 # Non-unit-clauses : 155 0.51/0.68 # Current number of unprocessed clauses: 4447 0.51/0.68 # ...number of literals in the above : 27872 0.51/0.68 # Current number of archived formulas : 0 0.51/0.68 # Current number of archived clauses : 34 0.51/0.68 # Clause-clause subsumption calls (NU) : 18100 0.51/0.68 # Rec. Clause-clause subsumption calls : 1204 0.51/0.68 # Non-unit clause-clause subsumptions : 6 0.51/0.68 # Unit Clause-clause subsumption calls : 2143 0.51/0.68 # Rewrite failures with RHS unbound : 0 0.51/0.68 # BW rewrite match attempts : 23 0.51/0.68 # BW rewrite match successes : 14 0.51/0.68 # Condensation attempts : 0 0.51/0.68 # Condensation successes : 0 0.51/0.68 # Termbank termtop insertions : 147533 0.51/0.68 0.51/0.68 # ------------------------------------------------- 0.51/0.68 # User time : 0.190 s 0.51/0.68 # System time : 0.015 s 0.51/0.68 # Total time : 0.205 s 0.51/0.68 # Maximum resident set size: 1736 pages 0.51/0.68 EOF