0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.34 % Computer : n015.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 : Tue Jul 13 14:28:04 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.37 # No SInE strategy applied 0.19/0.37 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S 0.19/0.37 # and selection function SelectNewComplexAHPNS. 0.19/0.37 # 0.19/0.37 # Presaturation interreduction done 0.19/0.37 # Number of axioms: 48 Number of unprocessed: 48 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 # 48 beginning clauses after preprocessing and clausification 0.19/0.37 # Creating start rules for all 6 conjectures. 0.19/0.37 # There are 6 start rule candidates: 0.19/0.37 # Found 18 unit axioms. 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.19/0.37 # 6 start rule tableaux created. 0.19/0.37 # 30 extension rule candidate clauses 0.19/0.37 # 18 unit axiom clauses 0.19/0.37 0.19/0.37 # Requested 8, 32 cores available to the main process. 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 6 0.19/0.37 # Returning from population with 33 new_tableaux and 0 remaining starting tableaux. 0.19/0.37 # We now have 33 tableaux to operate on 14.99/2.26 # There were 2 total branch saturation attempts. 14.99/2.26 # There were 0 of these attempts blocked. 14.99/2.26 # There were 0 deferred branch saturation attempts. 14.99/2.26 # There were 0 free duplicated saturations. 14.99/2.26 # There were 2 total successful branch saturations. 14.99/2.26 # There were 0 successful branch saturations in interreduction. 14.99/2.26 # There were 0 successful branch saturations on the branch. 14.99/2.26 # There were 2 successful branch saturations after the branch. 14.99/2.26 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 14.99/2.26 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 14.99/2.26 # Begin clausification derivation 14.99/2.26 14.99/2.26 # End clausification derivation 14.99/2.26 # Begin listing active clauses obtained from FOF to CNF conversion 14.99/2.26 cnf(i_0_10, plain, (id(X1,X1))). 14.99/2.26 cnf(i_0_13, plain, (r1(esk6_1(X1)))). 14.99/2.26 cnf(i_0_52, plain, (r1(esk15_1(X1)))). 14.99/2.26 cnf(i_0_49, plain, (r1(esk16_1(X1)))). 14.99/2.26 cnf(i_0_11, plain, (id(esk5_1(X1),X1))). 14.99/2.26 cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))). 14.99/2.26 cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))). 14.99/2.26 cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))). 14.99/2.26 cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))). 14.99/2.26 cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))). 14.99/2.26 cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))). 14.99/2.26 cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))). 14.99/2.26 cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))). 14.99/2.26 cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))). 14.99/2.26 cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))). 14.99/2.26 cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))). 14.99/2.26 cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))). 14.99/2.26 cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))). 14.99/2.26 cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))). 14.99/2.26 cnf(i_0_64, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). 14.99/2.26 cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))). 14.99/2.26 cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))). 14.99/2.26 cnf(i_0_60, negated_conjecture, (r1(esk23_1(X1))|id(X1,esk21_1(X1)))). 14.99/2.26 cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))). 14.99/2.26 cnf(i_0_59, negated_conjecture, (id(X1,esk23_1(X1))|id(X1,esk21_1(X1)))). 14.99/2.26 cnf(i_0_62, negated_conjecture, (r1(esk23_1(X1))|r2(esk22_1(X1),esk21_1(X1)))). 14.99/2.26 cnf(i_0_63, negated_conjecture, (r1(esk22_1(X1))|id(X1,esk23_1(X1)))). 14.99/2.26 cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))). 14.99/2.26 cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))). 14.99/2.26 cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))). 14.99/2.26 cnf(i_0_61, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|id(X1,esk23_1(X1)))). 14.99/2.26 cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))). 14.99/2.26 cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))). 14.99/2.26 cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))). 14.99/2.26 cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))). 14.99/2.26 cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))). 14.99/2.26 cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))). 14.99/2.26 cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))). 14.99/2.26 cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))). 14.99/2.26 cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))). 14.99/2.26 cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))). 14.99/2.26 cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))). 14.99/2.26 cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))). 14.99/2.26 cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))). 14.99/2.26 cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 14.99/2.26 cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 14.99/2.26 cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))). 14.99/2.26 cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))). 14.99/2.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 14.99/2.26 # Begin printing tableau 14.99/2.26 # Found 10 steps 14.99/2.26 cnf(i_0_61, negated_conjecture, (r2(esk22_1(esk13_0),esk21_1(esk13_0))|id(esk13_0,esk23_1(esk13_0))), inference(start_rule)). 14.99/2.26 cnf(i_0_65, plain, (r2(esk22_1(esk13_0),esk21_1(esk13_0))), inference(extension_rule, [i_0_17])). 14.99/2.26 cnf(i_0_88, plain, (id(esk21_1(esk13_0),esk7_1(esk22_1(esk13_0)))), inference(extension_rule, [i_0_31])). 14.99/2.26 cnf(i_0_15721, plain, (~r1(esk21_1(esk13_0))), inference(extension_rule, [i_0_45])). 14.99/2.26 cnf(i_0_15722, plain, (~r2(esk22_1(esk13_0),esk7_1(esk22_1(esk13_0)))), inference(extension_rule, [i_0_14])). 14.99/2.26 cnf(i_0_15782, plain, (~id(esk7_1(esk22_1(esk13_0)),esk7_1(esk22_1(esk13_0)))), inference(closure_rule, [i_0_10])). 14.99/2.26 cnf(i_0_66, plain, (id(esk13_0,esk23_1(esk13_0))), inference(extension_rule, [i_0_40])). 14.99/2.26 cnf(i_0_89890, plain, (id(esk23_1(esk13_0),esk13_0)), inference(extension_rule, [i_0_45])). 14.99/2.26 cnf(i_0_15747, plain, (~id(esk21_1(esk13_0),esk13_0)), inference(etableau_closure_rule, [i_0_15747, ...])). 14.99/2.26 cnf(i_0_90330, plain, (r1(esk23_1(esk13_0))), inference(etableau_closure_rule, [i_0_90330, ...])). 14.99/2.26 # End printing tableau 14.99/2.26 # SZS output end 14.99/2.26 # Branches closed with saturation will be marked with an "s" 14.99/2.27 # Child (11514) has found a proof. 14.99/2.27 14.99/2.27 # Proof search is over... 14.99/2.27 # Freeing feature tree 14.99/2.28 EOF