0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/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.32 Computer : n022.cluster.edu 0.12/0.32 Model : x86_64 x86_64 0.12/0.32 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 RAMPerCPU : 8042.1875MB 0.12/0.32 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 960 0.12/0.32 % WCLimit : 120 0.12/0.32 % DateTime : Tue Aug 9 02:42:46 EDT 2022 0.12/0.32 % CPUTime : 0.17/0.35 # No SInE strategy applied 0.17/0.35 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI 0.17/0.35 # and selection function SelectNewComplexAHP. 0.17/0.35 # 0.17/0.35 # Presaturation interreduction done 0.17/0.35 # Number of axioms: 32 Number of unprocessed: 32 0.17/0.35 # Tableaux proof search. 0.17/0.35 # APR header successfully linked. 0.17/0.35 # Hello from C++ 0.17/0.35 # The folding up rule is enabled... 0.17/0.35 # Local unification is enabled... 0.17/0.35 # Any saturation attempts will use folding labels... 0.17/0.35 # 32 beginning clauses after preprocessing and clausification 0.17/0.35 # Creating start rules for all 31 conjectures. 0.17/0.35 # There are 31 start rule candidates: 0.17/0.35 # Found 6 unit axioms. 0.17/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.17/0.35 # 31 start rule tableaux created. 0.17/0.35 # 26 extension rule candidate clauses 0.17/0.35 # 6 unit axiom clauses 0.17/0.35 0.17/0.35 # Requested 8, 32 cores available to the main process. 26.38/3.67 # There were 6 total branch saturation attempts. 26.38/3.67 # There were 0 of these attempts blocked. 26.38/3.67 # There were 0 deferred branch saturation attempts. 26.38/3.67 # There were 0 free duplicated saturations. 26.38/3.67 # There were 6 total successful branch saturations. 26.38/3.67 # There were 0 successful branch saturations in interreduction. 26.38/3.67 # There were 0 successful branch saturations on the branch. 26.38/3.67 # There were 6 successful branch saturations after the branch. 26.38/3.67 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 26.38/3.67 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 26.38/3.67 # Begin clausification derivation 26.38/3.67 26.38/3.67 # End clausification derivation 26.38/3.67 # Begin listing active clauses obtained from FOF to CNF conversion 26.38/3.67 cnf(i_0_24, negated_conjecture, (r1(esk1_0,esk3_0))). 26.38/3.67 cnf(i_0_21, negated_conjecture, (r1(esk1_0,esk7_0))). 26.38/3.67 cnf(i_0_27, negated_conjecture, (r1(esk3_0,esk4_0))). 26.38/3.67 cnf(i_0_25, negated_conjecture, (r1(esk3_0,esk5_0))). 26.38/3.67 cnf(i_0_32, plain, (r1(X1,X1))). 26.38/3.67 cnf(i_0_26, negated_conjecture, (~p1(esk5_0))). 26.38/3.67 cnf(i_0_28, negated_conjecture, (p1(X1)|~r1(esk4_0,X1))). 26.38/3.67 cnf(i_0_31, negated_conjecture, (~p4(X1)|~r1(esk1_0,X1))). 26.38/3.67 cnf(i_0_19, negated_conjecture, (~p2(esk8_1(X1))|~r1(esk7_0,X1))). 26.38/3.67 cnf(i_0_15, negated_conjecture, (~p3(esk10_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). 26.38/3.67 cnf(i_0_20, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk7_0,X1))). 26.38/3.67 cnf(i_0_17, negated_conjecture, (p2(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). 26.38/3.67 cnf(i_0_30, negated_conjecture, (p1(X1)|~p1(esk2_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_23, negated_conjecture, (p1(esk6_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). 26.38/3.68 cnf(i_0_22, negated_conjecture, (r1(X1,esk6_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). 26.38/3.68 cnf(i_0_18, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))). 26.38/3.68 cnf(i_0_29, negated_conjecture, (p1(X1)|r1(X2,esk2_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_16, negated_conjecture, (r1(esk9_2(X1,X2),esk10_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_4, negated_conjecture, (~p3(esk14_3(X1,X2,X3))|~p2(X4)|~r1(esk15_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_3, negated_conjecture, (r1(X1,esk15_1(X1))|~p3(esk14_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_8, negated_conjecture, (r1(X1,esk13_3(X2,X3,X1))|~p2(X4)|~r1(esk15_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_11, negated_conjecture, (~p3(esk11_3(X1,X2,X3))|~p2(X2)|~p2(X4)|~r1(esk12_3(X1,X2,X5),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X2,X5)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_1, negated_conjecture, (p2(esk13_3(X1,X2,X3))|r1(X1,esk15_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_2, negated_conjecture, (p2(esk13_3(X1,X2,X3))|~p2(X4)|~r1(esk15_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_13, negated_conjecture, (p2(X1)|~p2(X2)|~p2(X3)|~r1(esk12_3(X4,X2,X5),X3)|~r1(esk1_0,X4)|~r1(X2,X1)|~r1(X2,X5)|~r1(X4,X2))). 26.38/3.68 cnf(i_0_14, negated_conjecture, (p2(X1)|r1(X2,esk12_3(X3,X4,X2))|~p2(X4)|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))). 26.38/3.68 cnf(i_0_6, negated_conjecture, (r1(esk13_3(X1,X2,X3),esk14_3(X1,X2,X3))|~p2(X4)|~r1(esk15_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_7, negated_conjecture, (r1(X1,esk13_3(X2,X3,X1))|r1(X2,esk15_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_5, negated_conjecture, (r1(esk13_3(X1,X2,X3),esk14_3(X1,X2,X3))|r1(X1,esk15_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). 26.38/3.68 cnf(i_0_12, negated_conjecture, (r1(X1,esk12_3(X2,X3,X1))|~p3(esk11_3(X2,X3,X4))|~p2(X3)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_9, negated_conjecture, (r1(X1,esk11_3(X2,X3,X1))|~p2(X3)|~p2(X4)|~r1(esk12_3(X2,X3,X5),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X5)|~r1(X2,X3))). 26.38/3.68 cnf(i_0_10, negated_conjecture, (r1(X1,esk12_3(X2,X3,X1))|r1(X4,esk11_3(X2,X3,X4))|~p2(X3)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). 26.38/3.68 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 26.38/3.68 # Begin printing tableau 26.38/3.68 # Found 21 steps 26.38/3.68 cnf(i_0_14, negated_conjecture, (p2(esk1_0)|r1(esk1_0,esk12_3(esk1_0,esk1_0,esk1_0))|~p2(esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). 26.38/3.68 cnf(i_0_74, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_75, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_76, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_77, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_71, plain, (p2(esk1_0)), inference(extension_rule, [i_0_10])). 26.38/3.68 cnf(i_0_170, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_171, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_172, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_173, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_167, plain, (r1(esk1_0,esk12_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_9])). 26.38/3.68 cnf(i_0_175, plain, (~p2(esk1_0)), inference(closure_rule, [i_0_71])). 26.38/3.68 cnf(i_0_176, plain, (~p2(esk1_0)), inference(closure_rule, [i_0_71])). 26.38/3.68 cnf(i_0_179, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_180, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_32])). 26.38/3.68 cnf(i_0_72, plain, (r1(esk1_0,esk12_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_72, ...])). 26.38/3.68 cnf(i_0_73, plain, (~p2(esk1_0)), inference(etableau_closure_rule, [i_0_73, ...])). 26.38/3.68 cnf(i_0_168, plain, (r1(esk1_0,esk11_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_168, ...])). 26.38/3.68 cnf(i_0_174, plain, (r1(esk1_0,esk11_3(esk12_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_174, ...])). 26.38/3.68 cnf(i_0_177, plain, (~r1(esk12_3(esk12_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_177, ...])). 26.38/3.68 cnf(i_0_181, plain, (~r1(esk12_3(esk1_0,esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_181, ...])). 26.38/3.68 # End printing tableau 26.38/3.68 # SZS output end 26.38/3.68 # Branches closed with saturation will be marked with an "s" 26.38/3.68 # Child (28258) has found a proof. 26.38/3.68 26.38/3.68 # Proof search is over... 26.38/3.68 # Freeing feature tree 26.38/3.68 EOF