0.08/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/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 : n014.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1200 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Jul 13 12:37:04 EDT 2021 0.12/0.34 % CPUTime : 0.19/0.40 # No SInE strategy applied 0.19/0.40 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S 0.19/0.40 # and selection function SelectNewComplexAHPNS. 0.19/0.40 # 0.19/0.40 # Presaturation interreduction done 0.19/0.40 # Number of axioms: 43 Number of unprocessed: 43 0.19/0.40 # Tableaux proof search. 0.19/0.40 # APR header successfully linked. 0.19/0.40 # Hello from C++ 0.19/0.40 # The folding up rule is enabled... 0.19/0.40 # Local unification is enabled... 0.19/0.40 # Any saturation attempts will use folding labels... 0.19/0.40 # 43 beginning clauses after preprocessing and clausification 0.19/0.40 # Creating start rules for all 1 conjectures. 0.19/0.40 # There are 1 start rule candidates: 0.19/0.40 # Found 18 unit axioms. 0.19/0.40 # Closed tableau found in foldup close cycle with 0 folds and 5 closures done. 0.19/0.40 # Found closed tableau while making start rule 0.19/0.40 # There were 0 total branch saturation attempts. 0.19/0.40 # There were 0 of these attempts blocked. 0.19/0.40 # There were 0 deferred branch saturation attempts. 0.19/0.40 # There were 0 free duplicated saturations. 0.19/0.40 # There were 0 total successful branch saturations. 0.19/0.40 # There were 0 successful branch saturations in interreduction. 0.19/0.40 # There were 0 successful branch saturations on the branch. 0.19/0.40 # There were 0 successful branch saturations after the branch. 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.40 # Begin clausification derivation 0.19/0.40 0.19/0.40 # End clausification derivation 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.40 cnf(i_0_10, plain, (id(X1,X1))). 0.19/0.40 cnf(i_0_13, plain, (r1(esk6_1(X1)))). 0.19/0.40 cnf(i_0_52, plain, (r1(esk15_1(X1)))). 0.19/0.40 cnf(i_0_49, plain, (r1(esk16_1(X1)))). 0.19/0.40 cnf(i_0_11, plain, (id(esk5_1(X1),X1))). 0.19/0.40 cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))). 0.19/0.40 cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))). 0.19/0.40 cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))). 0.19/0.40 cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))). 0.19/0.40 cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))). 0.19/0.40 cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))). 0.19/0.40 cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))). 0.19/0.40 cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))). 0.19/0.40 cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))). 0.19/0.40 cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))). 0.19/0.40 cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))). 0.19/0.40 cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))). 0.19/0.40 cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))). 0.19/0.40 cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 0.19/0.40 cnf(i_0_59, negated_conjecture, (~r1(X1)|~r2(X1,X2)|~r2(X2,X3)|~r3(X4,X3,X5)|~id(X5,X6))). 0.19/0.40 cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))). 0.19/0.40 cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))). 0.19/0.40 cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))). 0.19/0.40 cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))). 0.19/0.40 cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))). 0.19/0.40 cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))). 0.19/0.40 cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 0.19/0.40 cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 0.19/0.40 cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))). 0.19/0.40 cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))). 0.19/0.40 cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))). 0.19/0.40 cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))). 0.19/0.40 cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))). 0.19/0.40 cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))). 0.19/0.40 cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))). 0.19/0.40 cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))). 0.19/0.40 cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 0.19/0.40 cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 0.19/0.40 cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 0.19/0.40 cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.19/0.40 cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.19/0.40 cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 0.19/0.40 cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.40 # Begin printing tableau 0.19/0.40 # Found 6 steps 0.19/0.40 cnf(i_0_59, negated_conjecture, (~r1(esk6_1(X13))|~r2(esk6_1(X13),esk3_2(X12,esk6_1(X13)))|~r2(esk3_2(X12,esk6_1(X13)),esk3_2(X16,esk3_2(X12,esk6_1(X13))))|~r3(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13))),esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))))|~id(esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))),esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))))), inference(start_rule)). 0.19/0.40 cnf(i_0_60, plain, (~r1(esk6_1(X13))), inference(closure_rule, [i_0_13])). 0.19/0.40 cnf(i_0_61, plain, (~r2(esk6_1(X13),esk3_2(X12,esk6_1(X13)))), inference(closure_rule, [i_0_8])). 0.19/0.40 cnf(i_0_62, plain, (~r2(esk3_2(X12,esk6_1(X13)),esk3_2(X16,esk3_2(X12,esk6_1(X13))))), inference(closure_rule, [i_0_8])). 0.19/0.40 cnf(i_0_63, plain, (~r3(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13))),esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))))), inference(closure_rule, [i_0_53])). 0.19/0.40 cnf(i_0_64, plain, (~id(esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))),esk20_2(X15,esk3_2(X16,esk3_2(X12,esk6_1(X13)))))), inference(closure_rule, [i_0_10])). 0.19/0.40 # End printing tableau 0.19/0.40 # SZS output end 0.19/0.40 # Branches closed with saturation will be marked with an "s" 0.19/0.40 # NOT attempting initial tableau saturation 0.19/0.40 # 1 start rule tableaux created. 0.19/0.40 # 25 extension rule candidate clauses 0.19/0.40 # 18 unit axiom clauses 0.19/0.40 0.19/0.40 # Proof search is over... 0.19/0.40 # Freeing feature tree 0.19/0.40 EOF