%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO026-3 : TPTP v8.1.0. Released v1.0.0. % 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 : n015.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:14 EDT 2022 % Result : Unsatisfiable 2.10s 0.65s % Output : CNFRefutation 2.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO026-3 : TPTP v8.1.0. Released v1.0.0. % 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 : n015.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 14:00:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 41 Number of unprocessed: 36 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 36 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 1 conjectures. % 0.12/0.38 # There are 1 start rule candidates: % 0.12/0.38 # Found 14 unit axioms. % 0.12/0.38 # 1 start rule tableaux created. % 0.12/0.38 # 22 extension rule candidate clauses % 0.12/0.38 # 14 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 8 tableaux to operate on % 2.10/0.65 # There were 1 total branch saturation attempts. % 2.10/0.65 # There were 0 of these attempts blocked. % 2.10/0.65 # There were 0 deferred branch saturation attempts. % 2.10/0.65 # There were 0 free duplicated saturations. % 2.10/0.65 # There were 1 total successful branch saturations. % 2.10/0.65 # There were 0 successful branch saturations in interreduction. % 2.10/0.65 # There were 0 successful branch saturations on the branch. % 2.10/0.65 # There were 1 successful branch saturations after the branch. % 2.10/0.65 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.10/0.65 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.10/0.65 # Begin clausification derivation % 2.10/0.65 % 2.10/0.65 # End clausification derivation % 2.10/0.65 # Begin listing active clauses obtained from FOF to CNF conversion % 2.10/0.65 cnf(i_0_80, hypothesis, (between(u,v,w))). % 2.10/0.65 cnf(i_0_81, hypothesis, (between(u,v,x))). % 2.10/0.65 cnf(i_0_43, plain, (equidistant(X1,X2,X2,X1))). % 2.10/0.65 cnf(i_0_82, hypothesis, (equidistant(v,w,v,x))). % 2.10/0.65 cnf(i_0_62, plain, (equidistant(X1,X2,X1,X2))). % 2.10/0.65 cnf(i_0_78, plain, (equidistant(X1,X1,X2,X2))). % 2.10/0.65 cnf(i_0_71, plain, (extension(X1,X2,X3,X3)=X2)). % 2.10/0.65 cnf(i_0_46, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 2.10/0.65 cnf(i_0_47, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 2.10/0.65 cnf(i_0_84, negated_conjecture, (x!=w)). % 2.10/0.65 cnf(i_0_83, hypothesis, (v!=u)). % 2.10/0.65 cnf(i_0_52, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 2.10/0.65 cnf(i_0_53, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 2.10/0.65 cnf(i_0_54, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 2.10/0.65 cnf(i_0_49, plain, (X1=X2|~between(X1,X2,X1))). % 2.10/0.65 cnf(i_0_45, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 2.10/0.65 cnf(i_0_77, plain, (X1=X2|extension(X2,X1,X2,X1)!=X1)). % 2.10/0.65 cnf(i_0_69, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X2,X1))). % 2.10/0.65 cnf(i_0_68, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X2,X1))). % 2.10/0.65 cnf(i_0_67, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X1,X2))). % 2.10/0.65 cnf(i_0_63, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X1,X2))). % 2.10/0.65 cnf(i_0_66, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X4,X3))). % 2.10/0.65 cnf(i_0_64, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X3,X4))). % 2.10/0.65 cnf(i_0_65, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X1,X2,X4,X3))). % 2.10/0.65 cnf(i_0_44, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))). % 2.10/0.65 cnf(i_0_70, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X1,X2,X5,X6))). % 2.10/0.65 cnf(i_0_51, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))). % 2.10/0.65 cnf(i_0_50, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))). % 2.10/0.65 cnf(i_0_57, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))). % 2.10/0.65 cnf(i_0_56, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))). % 2.10/0.65 cnf(i_0_79, plain, (equidistant(X1,X2,X3,X4)|~between(X3,X5,X4)|~between(X1,X6,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X1,X6,X3,X5))). % 2.10/0.65 cnf(i_0_58, 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))). % 2.10/0.65 cnf(i_0_60, 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))). % 2.10/0.65 cnf(i_0_55, 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))). % 2.10/0.65 cnf(i_0_59, 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))). % 2.10/0.65 cnf(i_0_48, 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))). % 2.10/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.10/0.65 # Begin printing tableau % 2.10/0.65 # Found 4 steps % 2.10/0.65 cnf(i_0_84, negated_conjecture, (x!=w), inference(start_rule)). % 2.10/0.65 cnf(i_0_87, plain, (x!=w), inference(extension_rule, [i_0_45])). % 2.10/0.65 cnf(i_0_91, plain, (~equidistant(x,w,X8,X8)), inference(extension_rule, [i_0_69])). % 2.10/0.65 cnf(i_0_169, plain, (~equidistant(X8,X8,w,x)), inference(etableau_closure_rule, [i_0_169, ...])). % 2.10/0.65 # End printing tableau % 2.10/0.65 # SZS output end % 2.10/0.65 # Branches closed with saturation will be marked with an "s" % 2.10/0.65 # Child (4769) has found a proof. % 2.10/0.65 % 2.10/0.65 # Proof search is over... % 2.10/0.65 # Freeing feature tree %------------------------------------------------------------------------------