0.09/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.32 % Computer : n029.cluster.edu 0.10/0.32 % Model : x86_64 x86_64 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.32 % Memory : 8042.1875MB 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.32 % CPULimit : 1200 0.10/0.32 % WCLimit : 120 0.10/0.32 % DateTime : Tue Jul 13 13:00:40 EDT 2021 0.10/0.32 % CPUTime : 0.10/0.35 # No SInE strategy applied 0.10/0.35 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.10/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.10/0.35 # 0.10/0.35 # Presaturation interreduction done 0.10/0.35 # Number of axioms: 50 Number of unprocessed: 50 0.10/0.35 # Tableaux proof search. 0.10/0.35 # APR header successfully linked. 0.10/0.35 # Hello from C++ 0.10/0.35 # The folding up rule is enabled... 0.10/0.35 # Local unification is enabled... 0.10/0.35 # Any saturation attempts will use folding labels... 0.10/0.35 # 50 beginning clauses after preprocessing and clausification 0.10/0.35 # Creating start rules for all 1 conjectures. 0.10/0.35 # There are 1 start rule candidates: 0.10/0.35 # Found 37 unit axioms. 0.10/0.35 # 1 start rule tableaux created. 0.10/0.35 # 13 extension rule candidate clauses 0.10/0.35 # 37 unit axiom clauses 0.10/0.35 0.10/0.35 # Requested 8, 32 cores available to the main process. 0.10/0.35 # There are not enough tableaux to fork, creating more from the initial 1 0.10/0.35 # Creating equality axioms 0.10/0.35 # Ran out of tableaux, making start rules for all clauses 0.10/0.35 # Returning from population with 57 new_tableaux and 0 remaining starting tableaux. 0.10/0.35 # We now have 57 tableaux to operate on 109.91/14.20 # There were 17 total branch saturation attempts. 109.91/14.20 # There were 3 of these attempts blocked. 109.91/14.20 # There were 0 deferred branch saturation attempts. 109.91/14.20 # There were 0 free duplicated saturations. 109.91/14.20 # There were 5 total successful branch saturations. 109.91/14.20 # There were 0 successful branch saturations in interreduction. 109.91/14.20 # There were 0 successful branch saturations on the branch. 109.91/14.20 # There were 5 successful branch saturations after the branch. 109.91/14.20 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 109.91/14.20 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 109.91/14.20 # Begin clausification derivation 109.91/14.20 109.91/14.20 # End clausification derivation 109.91/14.20 # Begin listing active clauses obtained from FOF to CNF conversion 109.91/14.20 cnf(i_0_1, plain, (incident(a3,s3))). 109.91/14.20 cnf(i_0_19, plain, (incident(a3,a3a1))). 109.91/14.20 cnf(i_0_21, plain, (incident(a3,a2a3))). 109.91/14.20 cnf(i_0_16, plain, (incident(b2,s2))). 109.91/14.20 cnf(i_0_30, plain, (incident(b2,b2b3))). 109.91/14.20 cnf(i_0_11, plain, (incident(b2,b1b2))). 109.91/14.20 cnf(i_0_9, plain, (incident(b3,s3))). 109.91/14.20 cnf(i_0_20, plain, (incident(b3,b3b1))). 109.91/14.20 cnf(i_0_7, plain, (incident(b3,b2b3))). 109.91/14.20 cnf(i_0_4, plain, (incident(b1,b3b1))). 109.91/14.20 cnf(i_0_31, plain, (incident(b1,b1b2))). 109.91/14.20 cnf(i_0_48, plain, (incident(b1,s1))). 109.91/14.20 cnf(i_0_40, plain, (incident(a1,a3a1))). 109.91/14.20 cnf(i_0_3, plain, (incident(a1,a1a2))). 109.91/14.20 cnf(i_0_45, plain, (incident(a1,s1))). 109.91/14.20 cnf(i_0_51, plain, (incident(p2,a3a1))). 109.91/14.20 cnf(i_0_5, plain, (incident(p2,b3b1))). 109.91/14.20 cnf(i_0_46, plain, (incident(a2,a1a2))). 109.91/14.20 cnf(i_0_17, plain, (incident(a2,a2a3))). 109.91/14.20 cnf(i_0_6, plain, (incident(a2,s2))). 109.91/14.20 cnf(i_0_12, plain, (incident(p1,a2a3))). 109.91/14.20 cnf(i_0_54, plain, (incident(p1,b2b3))). 109.91/14.20 cnf(i_0_22, plain, (incident(p3,a1a2))). 109.91/14.20 cnf(i_0_55, plain, (incident(p3,b1b2))). 109.91/14.20 cnf(i_0_36, plain, (incident(s,s3))). 109.91/14.20 cnf(i_0_24, plain, (incident(s,s2))). 109.91/14.20 cnf(i_0_38, plain, (incident(s,s1))). 109.91/14.20 cnf(i_0_34, negated_conjecture, (~goal)). 109.91/14.20 cnf(i_0_47, plain, (b3!=b2)). 109.91/14.20 cnf(i_0_10, plain, (b1!=b2)). 109.91/14.20 cnf(i_0_33, plain, (b1!=b3)). 109.91/14.20 cnf(i_0_29, plain, (a1!=a3)). 109.91/14.20 cnf(i_0_49, plain, (b3b1!=a3a1)). 109.91/14.20 cnf(i_0_18, plain, (a2!=a3)). 109.91/14.20 cnf(i_0_26, plain, (a2!=a1)). 109.91/14.20 cnf(i_0_15, plain, (b2b3!=a2a3)). 109.91/14.20 cnf(i_0_32, plain, (a1a2!=b1b2)). 109.91/14.20 cnf(i_0_25, plain, (point(X1)|~incident(X1,X2))). 109.91/14.20 cnf(i_0_28, plain, (line(X1)|~incident(X2,X1))). 109.91/14.20 cnf(i_0_8, plain, (incident(b2,a3a1)|incident(a3,b1b2))). 109.91/14.20 cnf(i_0_41, plain, (~incident(p2,X1)|~incident(p1,X1)|~incident(p3,X1))). 109.91/14.20 cnf(i_0_27, plain, (~incident(a3,b1b2)|~incident(a1,b2b3)|~incident(a2,b3b1))). 109.91/14.20 cnf(i_0_2, plain, (~incident(b2,a3a1)|~incident(b3,a1a2)|~incident(b1,a2a3))). 109.91/14.20 cnf(i_0_23, plain, (incident(a1,b2b3)|incident(b3,a1a2))). 109.91/14.20 cnf(i_0_35, plain, (incident(a2,b3b1)|incident(b1,a2a3))). 109.91/14.20 cnf(i_0_14, plain, (incident(X1,esk1_2(X2,X1))|~point(X2)|~point(X1))). 109.91/14.20 cnf(i_0_13, plain, (incident(X1,esk1_2(X1,X2))|~point(X2)|~point(X1))). 109.91/14.20 cnf(i_0_42, plain, (incident(esk2_2(X1,X2),X2)|~line(X2)|~line(X1))). 109.91/14.20 cnf(i_0_43, plain, (incident(esk2_2(X1,X2),X1)|~line(X2)|~line(X1))). 109.91/14.20 cnf(i_0_52, plain, (X1=X2|X3=X4|~incident(X2,X4)|~incident(X2,X3)|~incident(X1,X4)|~incident(X1,X3))). 109.91/14.20 cnf(i_0_94, plain, (X30=X30)). 109.91/14.20 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 109.91/14.20 # Begin printing tableau 109.91/14.20 # Found 14 steps 109.91/14.20 cnf(i_0_1, plain, (incident(a3,s3)), inference(start_rule)). 109.91/14.20 cnf(i_0_101, plain, (incident(a3,s3)), inference(extension_rule, [i_0_98])). 109.91/14.20 cnf(i_0_221, plain, ($false), inference(closure_rule, [i_0_94])). 109.91/14.20 cnf(i_0_220, plain, (incident(a3,b1b2)), inference(extension_rule, [i_0_27])). 109.91/14.20 cnf(i_0_219949, plain, (~incident(a1,b2b3)), inference(extension_rule, [i_0_23])). 109.91/14.20 cnf(i_0_219950, plain, (~incident(a2,b3b1)), inference(etableau_closure_rule, [i_0_219950, ...])). 109.91/14.20 cnf(i_0_272538, plain, (incident(b3,a1a2)), inference(etableau_closure_rule, [i_0_272538, ...])). 109.91/14.20 cnf(i_0_222, plain, (s3!=b1b2), inference(extension_rule, [i_0_52])). 109.91/14.20 cnf(i_0_337334, plain, (~incident(a3,b1b2)), inference(extension_rule, [i_0_8])). 109.91/14.20 cnf(i_0_337333, plain, (~incident(a3,s3)), inference(closure_rule, [i_0_1])). 109.91/14.20 cnf(i_0_337335, plain, (~incident(a3,s3)), inference(closure_rule, [i_0_1])). 109.91/14.20 cnf(i_0_337332, plain, (~incident(a3,b1b2)), inference(etableau_closure_rule, [i_0_337332, ...])). 109.91/14.20 cnf(i_0_337330, plain, (a3=a3), inference(etableau_closure_rule, [i_0_337330, ...])). 109.91/14.20 cnf(i_0_489351, plain, (incident(b2,a3a1)), inference(etableau_closure_rule, [i_0_489351, ...])). 109.91/14.20 # End printing tableau 109.91/14.20 # SZS output end 109.91/14.20 # Branches closed with saturation will be marked with an "s" 109.91/14.21 # Child (6447) has found a proof. 109.91/14.21 109.91/14.21 # Proof search is over... 109.91/14.21 # Freeing feature tree 109.91/14.22 EOF