0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.12/0.33 Computer : n019.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 03:28:21 EDT 2022 0.12/0.34 % CPUTime : 0.19/0.37 # No SInE strategy applied 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. 0.19/0.37 # 0.19/0.37 # Presaturation interreduction done 0.19/0.37 # Number of axioms: 17 Number of unprocessed: 17 0.19/0.37 # Tableaux proof search. 0.19/0.37 # APR header successfully linked. 0.19/0.37 # Hello from C++ 0.19/0.37 # The folding up rule is enabled... 0.19/0.37 # Local unification is enabled... 0.19/0.37 # Any saturation attempts will use folding labels... 0.19/0.37 # 17 beginning clauses after preprocessing and clausification 0.19/0.37 # Creating start rules for all 17 conjectures. 0.19/0.37 # There are 17 start rule candidates: 0.19/0.37 # Found 0 unit axioms. 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.19/0.37 # 17 start rule tableaux created. 0.19/0.37 # 17 extension rule candidate clauses 0.19/0.37 # 0 unit axiom clauses 0.19/0.37 0.19/0.37 # Requested 8, 32 cores available to the main process. 12.96/2.03 # There were 8 total branch saturation attempts. 12.96/2.03 # There were 0 of these attempts blocked. 12.96/2.03 # There were 0 deferred branch saturation attempts. 12.96/2.03 # There were 1 free duplicated saturations. 12.96/2.03 # There were 8 total successful branch saturations. 12.96/2.03 # There were 1 successful branch saturations in interreduction. 12.96/2.03 # There were 0 successful branch saturations on the branch. 12.96/2.03 # There were 6 successful branch saturations after the branch. 12.96/2.03 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 12.96/2.03 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 12.96/2.03 # Begin clausification derivation 12.96/2.03 12.96/2.03 # End clausification derivation 12.96/2.03 # Begin listing active clauses obtained from FOF to CNF conversion 12.96/2.03 cnf(i_0_16, negated_conjecture, (big_f(X1,X2,esk2_3(X2,X1,X3))|big_f(X3,X2,X1))). 12.96/2.03 cnf(i_0_7, negated_conjecture, (big_f(esk2_3(X1,X2,X3),X2,X1)|~big_f(X1,X2,X3))). 12.96/2.03 cnf(i_0_13, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X2,X1,esk2_3(X1,X2,X3))|~big_f(X3,X1,X2))). 12.96/2.03 cnf(i_0_14, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X1,X3,esk2_3(X3,X1,X2))|~big_f(X2,X3,X1))). 12.96/2.03 cnf(i_0_9, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X2,esk2_3(X2,X3,X1),X3)|~big_f(X3,X1,X2))). 12.96/2.03 cnf(i_0_12, negated_conjecture, (big_f(X1,esk2_3(X1,X2,X3),X2)|big_f(X2,X3,X1))). 12.96/2.03 cnf(i_0_15, negated_conjecture, (big_f(X1,X2,esk2_3(X2,X1,X3))|~big_f(X2,X1,X3)|~big_f(X1,X3,X2))). 12.96/2.03 cnf(i_0_10, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X1,esk2_3(X1,X2,X3),X2)|~big_f(X2,X3,X1))). 12.96/2.03 cnf(i_0_5, negated_conjecture, (big_f(X1,X2,X3)|big_f(X3,X1,X2)|~big_f(esk2_3(X3,X1,X2),X1,X3))). 12.96/2.03 cnf(i_0_6, negated_conjecture, (big_f(X1,X2,X3)|big_f(X2,X3,X1)|~big_f(esk2_3(X2,X3,X1),X3,X2))). 12.96/2.03 cnf(i_0_11, negated_conjecture, (big_f(X1,esk2_3(X1,X2,X3),X2)|~big_f(X3,X1,X2)|~big_f(X1,X2,X3))). 12.96/2.03 cnf(i_0_8, negated_conjecture, (big_f(esk2_3(X1,X2,X3),X2,X1)|~big_f(X2,X3,X1)|~big_f(X3,X1,X2))). 12.96/2.03 cnf(i_0_17, negated_conjecture, (big_f(X1,X2,X3)|big_f(X2,X3,X1)|~big_f(esk1_0,esk1_0,esk2_3(X3,X1,X2))|~big_f(X3,X1,X2))). 12.96/2.03 cnf(i_0_4, negated_conjecture, (~big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|~big_f(X1,X2,X3)|~big_f(X3,X1,X2)|~big_f(X2,X3,X1))). 12.96/2.03 cnf(i_0_3, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X2,X3,X1))). 12.96/2.03 cnf(i_0_2, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X3,X1,X2))). 12.96/2.03 cnf(i_0_1, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X1,X2,X3))). 12.96/2.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 12.96/2.03 # Begin printing tableau 12.96/2.03 # Found 15 steps 12.96/2.03 cnf(i_0_10, negated_conjecture, (big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))|~big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk2_3(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0)),esk1_0)|~big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(start_rule)). 12.96/2.03 cnf(i_0_44, plain, (big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_5])). 12.96/2.03 cnf(i_0_3394, plain, (big_f(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0)), inference(extension_rule, [i_0_5])). 12.96/2.03 cnf(i_0_157520, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(extension_rule, [i_0_11])). 12.96/2.03 cnf(i_0_157521, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(extension_rule, [i_0_15])). 12.96/2.03 cnf(i_0_169245, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(closure_rule, [i_0_157521])). 12.96/2.03 cnf(i_0_3393, plain, (big_f(esk1_0,esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_17])). 12.96/2.03 cnf(i_0_46, plain, (~big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_46, ...])). 12.96/2.03 cnf(i_0_45, plain, (~big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk2_3(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0)),esk1_0)), inference(etableau_closure_rule, [i_0_45, ...])). 12.96/2.03 cnf(i_0_157533, plain, (big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_157533, ...])). 12.96/2.03 cnf(i_0_157535, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_157535, ...])). 12.96/2.03 cnf(i_0_169244, plain, (big_f(esk1_0,esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_169244, ...])). 12.96/2.03 cnf(i_0_169281, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_169281, ...])). 12.96/2.03 cnf(i_0_169282, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_169282, ...])). 12.96/2.03 cnf(i_0_169284, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_169284, ...])). 12.96/2.03 # End printing tableau 12.96/2.03 # SZS output end 12.96/2.03 # Branches closed with saturation will be marked with an "s" 12.96/2.03 # Child (17347) has found a proof. 12.96/2.03 12.96/2.03 # Proof search is over... 12.96/2.03 # Freeing feature tree 12.96/2.03 EOF