%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO030-2 : 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 : n007.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:15 EDT 2022 % Result : Unsatisfiable 0.45s 0.61s % Output : CNFRefutation 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GEO030-2 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n007.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jun 17 16:21:27 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___211_C18_F1_AE_CS_SP_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Number of axioms: 23 Number of unprocessed: 23 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.19/0.49 # The folding up rule is enabled... % 0.19/0.49 # Local unification is enabled... % 0.19/0.49 # Any saturation attempts will use folding labels... % 0.19/0.49 # 23 beginning clauses after preprocessing and clausification % 0.19/0.49 # Creating start rules for all 1 conjectures. % 0.19/0.49 # There are 1 start rule candidates: % 0.19/0.49 # Found 11 unit axioms. % 0.19/0.49 # 1 start rule tableaux created. % 0.19/0.49 # 12 extension rule candidate clauses % 0.19/0.49 # 11 unit axiom clauses % 0.19/0.49 % 0.19/0.49 # Requested 8, 32 cores available to the main process. % 0.19/0.49 # There are not enough tableaux to fork, creating more from the initial 1 % 0.45/0.61 # There were 2 total branch saturation attempts. % 0.45/0.61 # There were 0 of these attempts blocked. % 0.45/0.61 # There were 0 deferred branch saturation attempts. % 0.45/0.61 # There were 0 free duplicated saturations. % 0.45/0.61 # There were 2 total successful branch saturations. % 0.45/0.61 # There were 0 successful branch saturations in interreduction. % 0.45/0.61 # There were 0 successful branch saturations on the branch. % 0.45/0.61 # There were 2 successful branch saturations after the branch. % 0.45/0.61 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.45/0.61 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.45/0.61 # Begin clausification derivation % 0.45/0.61 % 0.45/0.61 # End clausification derivation % 0.45/0.61 # Begin listing active clauses obtained from FOF to CNF conversion % 0.45/0.61 cnf(i_0_45, hypothesis, (v!=u)). % 0.45/0.61 cnf(i_0_46, negated_conjecture, (w1!=w)). % 0.45/0.61 cnf(i_0_42, hypothesis, (between(u,v,w))). % 0.45/0.61 cnf(i_0_33, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 0.45/0.61 cnf(i_0_34, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 0.45/0.61 cnf(i_0_35, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 0.45/0.61 cnf(i_0_30, plain, (X1=X2|~between(X1,X2,X1))). % 0.45/0.61 cnf(i_0_43, hypothesis, (equidistant(u,w,u,w1))). % 0.45/0.61 cnf(i_0_44, hypothesis, (equidistant(v,w,v,w1))). % 0.45/0.61 cnf(i_0_24, plain, (equidistant(X1,X2,X2,X1))). % 0.45/0.61 cnf(i_0_26, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 0.45/0.61 cnf(i_0_27, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 0.45/0.61 cnf(i_0_28, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 0.45/0.61 cnf(i_0_25, plain, (equidistant(X3,X4,X5,X6)|~equidistant(X1,X2,X5,X6)|~equidistant(X1,X2,X3,X4))). % 0.45/0.61 cnf(i_0_36, plain, (X2=X3|between(X5,X1,X4)|between(X4,X5,X1)|between(X1,X4,X5)|~equidistant(X5,X2,X5,X3)|~equidistant(X4,X2,X4,X3)|~equidistant(X1,X2,X1,X3))). % 0.45/0.61 cnf(i_0_29, plain, (X1=X2|equidistant(X5,X7,X6,X8)|~between(X3,X4,X6)|~between(X1,X2,X5)|~equidistant(X2,X7,X4,X8)|~equidistant(X2,X5,X4,X6)|~equidistant(X1,X7,X3,X8)|~equidistant(X1,X2,X3,X4))). % 0.45/0.61 cnf(i_0_32, plain, (between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)|~between(X4,X5,X3)|~between(X1,X2,X3))). % 0.45/0.61 cnf(i_0_31, plain, (between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)|~between(X4,X5,X3)|~between(X1,X2,X3))). % 0.45/0.61 cnf(i_0_38, plain, (X1=X2|between(X1,X5,euclid2(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))). % 0.45/0.61 cnf(i_0_37, plain, (X1=X2|between(X1,X4,euclid1(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))). % 0.45/0.61 cnf(i_0_39, plain, (X1=X2|between(euclid1(X1,X4,X2,X5,X3),X3,euclid2(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))). % 0.45/0.61 cnf(i_0_40, plain, (between(X3,continuous(X1,X2,X3,X6,X4,X5),X5)|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))). % 0.45/0.61 cnf(i_0_41, plain, (equidistant(X1,X6,X1,continuous(X1,X2,X3,X6,X4,X5))|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))). % 0.45/0.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.45/0.61 # Begin printing tableau % 0.45/0.61 # Found 7 steps % 0.45/0.61 cnf(i_0_46, negated_conjecture, (w1!=w), inference(start_rule)). % 0.45/0.61 cnf(i_0_47, plain, (w1!=w), inference(extension_rule, [i_0_39])). % 0.45/0.61 cnf(i_0_86, plain, (~between(X22,w,extension(X22,w,X18,X19))), inference(closure_rule, [i_0_27])). % 0.45/0.61 cnf(i_0_87, plain, (~between(w1,w,extension(w1,w,X20,X21))), inference(closure_rule, [i_0_27])). % 0.45/0.61 cnf(i_0_85, plain, (between(euclid1(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)),extension(w1,w,X20,X21),euclid2(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)))), inference(extension_rule, [i_0_32])). % 0.45/0.61 cnf(i_0_121, plain, (~between(euclid1(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)),extension(w1,w,X20,X21),euclid2(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)))), inference(closure_rule, [i_0_85])). % 0.45/0.61 cnf(i_0_120, plain, (between(extension(w1,w,X20,X21),inner_pasch(euclid1(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)),extension(w1,w,X20,X21),euclid2(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)),extension(w1,w,X20,X21),euclid1(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21))),euclid1(w1,X22,w,extension(X22,w,X18,X19),extension(w1,w,X20,X21)))), inference(etableau_closure_rule, [i_0_120, ...])). % 0.45/0.61 # End printing tableau % 0.45/0.61 # SZS output end % 0.45/0.61 # Branches closed with saturation will be marked with an "s" % 0.45/0.61 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.45/0.61 # We now have 10 tableaux to operate on % 0.45/0.61 # Found closed tableau during pool population. % 0.45/0.61 # Proof search is over... % 0.45/0.61 # Freeing feature tree %------------------------------------------------------------------------------