%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO033-3 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n009.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sat Jul 16 04:07:17 EDT 2022 % Result : Unsatisfiable 1.20s 0.63s % Output : CNFRefutation 1.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.14 % Problem : GEO033-3 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n009.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sat Jun 18 18:34:08 EDT 2022 % 0.14/0.36 % CPUTime : % 0.22/0.40 # No SInE strategy applied % 0.22/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.22/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.22/0.40 # % 0.22/0.40 # Presaturation interreduction done % 0.22/0.40 # Number of axioms: 72 Number of unprocessed: 63 % 0.22/0.40 # Tableaux proof search. % 0.22/0.40 # APR header successfully linked. % 0.22/0.40 # Hello from C++ % 0.22/0.40 # The folding up rule is enabled... % 0.22/0.40 # Local unification is enabled... % 0.22/0.40 # Any saturation attempts will use folding labels... % 0.22/0.40 # 63 beginning clauses after preprocessing and clausification % 0.22/0.40 # Creating start rules for all 1 conjectures. % 0.22/0.40 # There are 1 start rule candidates: % 0.22/0.40 # Found 24 unit axioms. % 0.22/0.40 # 1 start rule tableaux created. % 0.22/0.40 # 39 extension rule candidate clauses % 0.22/0.40 # 24 unit axiom clauses % 0.22/0.40 % 0.22/0.40 # Requested 8, 32 cores available to the main process. % 0.22/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.22/0.40 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.22/0.40 # We now have 13 tableaux to operate on % 1.20/0.63 # There were 1 total branch saturation attempts. % 1.20/0.63 # There were 0 of these attempts blocked. % 1.20/0.63 # There were 0 deferred branch saturation attempts. % 1.20/0.63 # There were 0 free duplicated saturations. % 1.20/0.63 # There were 1 total successful branch saturations. % 1.20/0.63 # There were 0 successful branch saturations in interreduction. % 1.20/0.63 # There were 0 successful branch saturations on the branch. % 1.20/0.63 # There were 1 successful branch saturations after the branch. % 1.20/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.20/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.20/0.63 # Begin clausification derivation % 1.20/0.63 % 1.20/0.63 # End clausification derivation % 1.20/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 1.20/0.63 cnf(i_0_142, hypothesis, (equidistant(u,v,u1,v1))). % 1.20/0.63 cnf(i_0_146, hypothesis, (between(u,v,w))). % 1.20/0.63 cnf(i_0_147, hypothesis, (between(u1,v1,w1))). % 1.20/0.63 cnf(i_0_144, hypothesis, (equidistant(u,x,u1,x1))). % 1.20/0.63 cnf(i_0_143, hypothesis, (equidistant(v,w,v1,w1))). % 1.20/0.63 cnf(i_0_145, hypothesis, (equidistant(w,x,w1,x1))). % 1.20/0.63 cnf(i_0_118, plain, (between(X1,X2,X2))). % 1.20/0.63 cnf(i_0_121, plain, (between(X1,X1,X2))). % 1.20/0.63 cnf(i_0_75, plain, (equidistant(X1,X2,X2,X1))). % 1.20/0.63 cnf(i_0_94, plain, (equidistant(X1,X2,X1,X2))). % 1.20/0.63 cnf(i_0_110, plain, (equidistant(X1,X1,X2,X2))). % 1.20/0.63 cnf(i_0_103, plain, (extension(X1,X2,X3,X3)=X2)). % 1.20/0.63 cnf(i_0_78, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 1.20/0.63 cnf(i_0_79, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 1.20/0.63 cnf(i_0_136, plain, (equidistant(X1,extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X3,extension(X4,X3,lower_dimension_point_1,lower_dimension_point_2)))). % 1.20/0.63 cnf(i_0_117, plain, (extension(extension(X1,X2,X1,X2),X2,extension(X1,X2,X1,X2),X2)=X1)). % 1.20/0.63 cnf(i_0_132, plain, (lower_dimension_point_2!=lower_dimension_point_1)). % 1.20/0.63 cnf(i_0_148, negated_conjecture, (~equidistant(v,x,v1,x1))). % 1.20/0.63 cnf(i_0_134, plain, (lower_dimension_point_3!=lower_dimension_point_1)). % 1.20/0.63 cnf(i_0_133, plain, (lower_dimension_point_3!=lower_dimension_point_2)). % 1.20/0.63 cnf(i_0_84, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 1.20/0.63 cnf(i_0_85, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 1.20/0.63 cnf(i_0_86, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 1.20/0.63 cnf(i_0_135, plain, (extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2)!=X2)). % 1.20/0.63 cnf(i_0_81, plain, (X1=X2|~between(X1,X2,X1))). % 1.20/0.63 cnf(i_0_77, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 1.20/0.63 cnf(i_0_109, plain, (X1=X2|extension(X2,X1,X2,X1)!=X1)). % 1.20/0.63 cnf(i_0_123, plain, (X1=X2|~between(X3,X2,X1)|~between(X3,X1,X2))). % 1.20/0.63 cnf(i_0_122, plain, (X1=X2|~between(X2,X1,X3)|~between(X1,X2,X3))). % 1.20/0.63 cnf(i_0_120, plain, (between(X1,X2,X3)|~between(X3,X2,X1))). % 1.20/0.63 cnf(i_0_119, plain, (between(X1,X2,X3)|~between(X3,X2,X3))). % 1.20/0.63 cnf(i_0_101, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X2,X1))). % 1.20/0.63 cnf(i_0_100, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X2,X1))). % 1.20/0.63 cnf(i_0_99, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X1,X2))). % 1.20/0.63 cnf(i_0_95, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X1,X2))). % 1.20/0.63 cnf(i_0_98, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X4,X3))). % 1.20/0.63 cnf(i_0_96, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X3,X4))). % 1.20/0.63 cnf(i_0_97, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X1,X2,X4,X3))). % 1.20/0.63 cnf(i_0_113, plain, (extension(X1,X2,X2,X3)=X3|X1=X2|~between(X1,X2,X3))). % 1.20/0.63 cnf(i_0_127, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X4,X1,X2))). % 1.20/0.63 cnf(i_0_130, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X1,X4,X3))). % 1.20/0.63 cnf(i_0_131, plain, (between(X1,X2,X3)|~between(X1,X4,X3)|~between(X1,X2,X4))). % 1.20/0.63 cnf(i_0_115, plain, (extension(X1,X2,X1,X2)=extension(X1,X2,X2,X1)|X1=X2)). % 1.20/0.63 cnf(i_0_128, plain, (X1=X2|between(X3,X2,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))). % 1.20/0.63 cnf(i_0_129, plain, (X1=X2|between(X3,X1,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))). % 1.20/0.63 cnf(i_0_112, plain, (X1=X2|X3=X4|~between(X1,X2,X4)|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4))). % 1.20/0.63 cnf(i_0_76, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))). % 1.20/0.63 cnf(i_0_102, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X1,X2,X5,X6))). % 1.20/0.63 cnf(i_0_139, plain, (X1=X2|X3=X4|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4)|~equidistant(X1,X3,X1,X4))). % 1.20/0.63 cnf(i_0_83, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))). % 1.20/0.63 cnf(i_0_82, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))). % 1.20/0.63 cnf(i_0_114, plain, (extension(X1,X2,X3,X4)=extension(X1,X2,X5,X6)|X1=X2|~equidistant(X3,X4,X5,X6))). % 1.20/0.63 cnf(i_0_89, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))). % 1.20/0.63 cnf(i_0_88, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))). % 1.20/0.63 cnf(i_0_141, plain, (equidistant(X1,X2,X3,X4)|~between(X5,X3,X4)|~between(X6,X1,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X6,X1,X5,X3))). % 1.20/0.63 cnf(i_0_111, plain, (equidistant(X1,X2,X3,X4)|~between(X3,X5,X4)|~between(X1,X6,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X1,X6,X3,X5))). % 1.20/0.63 cnf(i_0_92, plain, (equidistant(X1,X2,X1,continuous(X1,X3,X4,X2,X5,X6))|~between(X3,X2,X5)|~between(X1,X3,X5)|~equidistant(X1,X5,X1,X6)|~equidistant(X1,X3,X1,X4))). % 1.20/0.63 cnf(i_0_90, plain, (X1=X2|between(euclid1(X1,X3,X2,X4,X5),X5,euclid2(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))). % 1.20/0.63 cnf(i_0_91, plain, (between(X1,continuous(X2,X3,X1,X4,X5,X6),X6)|~between(X3,X4,X5)|~between(X2,X3,X5)|~equidistant(X2,X5,X2,X6)|~equidistant(X2,X3,X2,X1))). % 1.20/0.63 cnf(i_0_140, plain, (equidistant(X1,X2,X3,X4)|~between(X5,X3,X6)|~between(X7,X1,X8)|~equidistant(X8,X2,X6,X4)|~equidistant(X7,X2,X5,X4)|~equidistant(X7,X8,X5,X6)|~equidistant(X7,X1,X5,X3))). % 1.20/0.63 cnf(i_0_87, plain, (X1=X2|between(X3,X4,X5)|between(X4,X5,X3)|between(X5,X3,X4)|~equidistant(X5,X1,X5,X2)|~equidistant(X4,X1,X4,X2)|~equidistant(X3,X1,X3,X2))). % 1.20/0.63 cnf(i_0_80, plain, (X1=X2|equidistant(X3,X4,X5,X6)|~between(X7,X8,X5)|~between(X1,X2,X3)|~equidistant(X2,X4,X8,X6)|~equidistant(X2,X3,X8,X5)|~equidistant(X1,X4,X7,X6)|~equidistant(X1,X2,X7,X8))). % 1.20/0.63 cnf(i_0_138, plain, (between(X1,inner_pasch(X2,inner_pasch(X3,X4,X5,X2,X6),X3,X1,X6),X2)|between(X4,inner_pasch(X2,inner_pasch(X3,X4,X5,X2,X6),X3,X1,X6),X6)|~between(X5,X2,X6)|~between(X3,X4,X5)|~between(X3,X1,X6))). % 1.20/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.20/0.63 # Begin printing tableau % 1.20/0.63 # Found 9 steps % 1.20/0.63 cnf(i_0_148, negated_conjecture, (~equidistant(v,x,v1,x1)), inference(start_rule)). % 1.20/0.63 cnf(i_0_152, plain, (~equidistant(v,x,v1,x1)), inference(extension_rule, [i_0_140])). % 1.20/0.63 cnf(i_0_263, plain, (~between(u1,v1,w1)), inference(closure_rule, [i_0_147])). % 1.20/0.63 cnf(i_0_264, plain, (~between(u,v,w)), inference(closure_rule, [i_0_146])). % 1.20/0.63 cnf(i_0_265, plain, (~equidistant(w,x,w1,x1)), inference(closure_rule, [i_0_145])). % 1.20/0.63 cnf(i_0_266, plain, (~equidistant(u,x,u1,x1)), inference(closure_rule, [i_0_144])). % 1.20/0.63 cnf(i_0_268, plain, (~equidistant(u,v,u1,v1)), inference(closure_rule, [i_0_142])). % 1.20/0.63 cnf(i_0_267, plain, (~equidistant(u,w,u1,w1)), inference(extension_rule, [i_0_101])). % 1.20/0.63 cnf(i_0_306, plain, (~equidistant(w1,u1,w,u)), inference(etableau_closure_rule, [i_0_306, ...])). % 1.20/0.63 # End printing tableau % 1.20/0.63 # SZS output end % 1.20/0.63 # Branches closed with saturation will be marked with an "s" % 1.20/0.63 # Child (10194) has found a proof. % 1.20/0.63 % 1.20/0.63 # Proof search is over... % 1.20/0.63 # Freeing feature tree %------------------------------------------------------------------------------