%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO032-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 : n006.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:16 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO032-3 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n006.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jun 18 04:24:55 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 69 Number of unprocessed: 60 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 60 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 22 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 38 extension rule candidate clauses % 0.12/0.37 # 22 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Closed tableau found in foldup close cycle with 0 folds and 6 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_138, hypothesis, (between(u,v,w))). % 0.12/0.37 cnf(i_0_139, hypothesis, (between(u1,v1,w1))). % 0.12/0.37 cnf(i_0_140, hypothesis, (equidistant(u,v,u1,v1))). % 0.12/0.37 cnf(i_0_141, hypothesis, (equidistant(u,w,u1,w1))). % 0.12/0.37 cnf(i_0_115, plain, (between(X1,X2,X2))). % 0.12/0.37 cnf(i_0_118, plain, (between(X1,X1,X2))). % 0.12/0.37 cnf(i_0_72, plain, (equidistant(X1,X2,X2,X1))). % 0.12/0.37 cnf(i_0_91, plain, (equidistant(X1,X2,X1,X2))). % 0.12/0.37 cnf(i_0_107, plain, (equidistant(X1,X1,X2,X2))). % 0.12/0.37 cnf(i_0_100, plain, (extension(X1,X2,X3,X3)=X2)). % 0.12/0.37 cnf(i_0_75, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 0.12/0.37 cnf(i_0_76, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 0.12/0.37 cnf(i_0_133, 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)))). % 0.12/0.37 cnf(i_0_114, plain, (extension(extension(X1,X2,X1,X2),X2,extension(X1,X2,X1,X2),X2)=X1)). % 0.12/0.37 cnf(i_0_129, plain, (lower_dimension_point_2!=lower_dimension_point_1)). % 0.12/0.37 cnf(i_0_142, negated_conjecture, (~equidistant(v,w,v1,w1))). % 0.12/0.37 cnf(i_0_131, plain, (lower_dimension_point_3!=lower_dimension_point_1)). % 0.12/0.37 cnf(i_0_130, plain, (lower_dimension_point_3!=lower_dimension_point_2)). % 0.12/0.37 cnf(i_0_81, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 0.12/0.37 cnf(i_0_82, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 0.12/0.37 cnf(i_0_83, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 0.12/0.37 cnf(i_0_132, plain, (extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2)!=X2)). % 0.12/0.37 cnf(i_0_78, plain, (X1=X2|~between(X1,X2,X1))). % 0.12/0.37 cnf(i_0_74, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 0.12/0.37 cnf(i_0_117, plain, (between(X1,X2,X3)|~between(X3,X2,X1))). % 0.12/0.37 cnf(i_0_106, plain, (X1=X2|extension(X2,X1,X2,X1)!=X1)). % 0.12/0.37 cnf(i_0_120, plain, (X1=X2|~between(X3,X2,X1)|~between(X3,X1,X2))). % 0.12/0.37 cnf(i_0_119, plain, (X1=X2|~between(X2,X1,X3)|~between(X1,X2,X3))). % 0.12/0.37 cnf(i_0_98, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X2,X1))). % 0.12/0.37 cnf(i_0_116, plain, (between(X1,X2,X3)|~between(X3,X2,X3))). % 0.12/0.37 cnf(i_0_97, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X2,X1))). % 0.12/0.37 cnf(i_0_96, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X1,X2))). % 0.12/0.37 cnf(i_0_92, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X1,X2))). % 0.12/0.37 cnf(i_0_95, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X4,X3))). % 0.12/0.37 cnf(i_0_93, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X3,X4))). % 0.12/0.37 cnf(i_0_94, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X1,X2,X4,X3))). % 0.12/0.37 cnf(i_0_124, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X4,X1,X2))). % 0.12/0.37 cnf(i_0_127, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X1,X4,X3))). % 0.12/0.37 cnf(i_0_110, plain, (extension(X1,X2,X2,X3)=X3|X1=X2|~between(X1,X2,X3))). % 0.12/0.37 cnf(i_0_128, plain, (between(X1,X2,X3)|~between(X1,X4,X3)|~between(X1,X2,X4))). % 0.12/0.37 cnf(i_0_73, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))). % 0.12/0.37 cnf(i_0_125, plain, (X1=X2|between(X3,X2,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))). % 0.12/0.37 cnf(i_0_112, plain, (extension(X1,X2,X1,X2)=extension(X1,X2,X2,X1)|X1=X2)). % 0.12/0.37 cnf(i_0_126, plain, (X1=X2|between(X3,X1,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))). % 0.12/0.37 cnf(i_0_109, plain, (X1=X2|X3=X4|~between(X1,X2,X4)|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4))). % 0.12/0.37 cnf(i_0_99, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X1,X2,X5,X6))). % 0.12/0.37 cnf(i_0_136, plain, (X1=X2|X3=X4|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4)|~equidistant(X1,X3,X1,X4))). % 0.12/0.37 cnf(i_0_80, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))). % 0.12/0.37 cnf(i_0_79, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))). % 0.12/0.37 cnf(i_0_86, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))). % 0.12/0.37 cnf(i_0_111, plain, (extension(X1,X2,X3,X4)=extension(X1,X2,X5,X6)|X1=X2|~equidistant(X3,X4,X5,X6))). % 0.12/0.37 cnf(i_0_85, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))). % 0.12/0.37 cnf(i_0_108, plain, (equidistant(X1,X2,X3,X4)|~between(X3,X5,X4)|~between(X1,X6,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X1,X6,X3,X5))). % 0.12/0.37 cnf(i_0_89, 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))). % 0.12/0.37 cnf(i_0_88, 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))). % 0.12/0.37 cnf(i_0_87, 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))). % 0.12/0.37 cnf(i_0_137, 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))). % 0.12/0.37 cnf(i_0_84, 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))). % 0.12/0.37 cnf(i_0_77, 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))). % 0.12/0.37 cnf(i_0_135, 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))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 8 steps % 0.12/0.37 cnf(i_0_142, negated_conjecture, (~equidistant(v,w,v1,w1)), inference(start_rule)). % 0.12/0.37 cnf(i_0_146, plain, (~equidistant(v,w,v1,w1)), inference(extension_rule, [i_0_137])). % 0.12/0.37 cnf(i_0_252, plain, (~between(u1,v1,w1)), inference(closure_rule, [i_0_139])). % 0.12/0.37 cnf(i_0_253, plain, (~between(u,v,w)), inference(closure_rule, [i_0_138])). % 0.12/0.37 cnf(i_0_254, plain, (~equidistant(w,w,w1,w1)), inference(closure_rule, [i_0_107])). % 0.12/0.37 cnf(i_0_255, plain, (~equidistant(u,w,u1,w1)), inference(closure_rule, [i_0_141])). % 0.12/0.37 cnf(i_0_256, plain, (~equidistant(u,w,u1,w1)), inference(closure_rule, [i_0_141])). % 0.12/0.37 cnf(i_0_257, plain, (~equidistant(u,v,u1,v1)), inference(closure_rule, [i_0_140])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 11 tableaux to operate on % 0.12/0.37 # Found closed tableau during pool population. % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------