%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO010-1 : TPTP v8.1.0. Bugfixed v2.5.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 : n019.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:05 EDT 2022 % Result : Unsatisfiable 0.19s 0.46s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : GEO010-1 : TPTP v8.1.0. Bugfixed v2.5.0. % 0.10/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.34 % Computer : n019.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sat Jun 18 06:19:09 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 26 Number of unprocessed: 26 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 26 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 7 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 19 extension rule candidate clauses % 0.13/0.37 # 7 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 9 tableaux to operate on % 0.19/0.46 # There were 5 total branch saturation attempts. % 0.19/0.46 # There were 0 of these attempts blocked. % 0.19/0.46 # There were 0 deferred branch saturation attempts. % 0.19/0.46 # There were 0 free duplicated saturations. % 0.19/0.46 # There were 5 total successful branch saturations. % 0.19/0.46 # There were 0 successful branch saturations in interreduction. % 0.19/0.46 # There were 0 successful branch saturations on the branch. % 0.19/0.46 # There were 5 successful branch saturations after the branch. % 0.19/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # Begin clausification derivation % 0.19/0.46 % 0.19/0.46 # End clausification derivation % 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.46 cnf(i_0_51, hypothesis, (colinear(a,b,c))). % 0.19/0.46 cnf(i_0_30, plain, (equidistant(X1,X2,X2,X1))). % 0.19/0.46 cnf(i_0_39, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 0.19/0.46 cnf(i_0_40, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 0.19/0.46 cnf(i_0_41, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 0.19/0.46 cnf(i_0_42, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 0.19/0.46 cnf(i_0_43, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 0.19/0.46 cnf(i_0_52, negated_conjecture, (~colinear(a,c,b)|~colinear(b,a,c)|~colinear(b,c,a)|~colinear(c,a,b)|~colinear(c,b,a))). % 0.19/0.46 cnf(i_0_27, plain, (X1=X2|~between(X1,X2,X1))). % 0.19/0.46 cnf(i_0_31, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 0.19/0.46 cnf(i_0_49, plain, (colinear(X1,X2,X3)|~between(X2,X1,X3))). % 0.19/0.46 cnf(i_0_50, plain, (colinear(X1,X2,X3)|~between(X1,X3,X2))). % 0.19/0.46 cnf(i_0_48, plain, (colinear(X1,X2,X3)|~between(X1,X2,X3))). % 0.19/0.46 cnf(i_0_28, plain, (between(X1,X2,X3)|~between(X2,X3,X4)|~between(X1,X2,X4))). % 0.19/0.46 cnf(i_0_47, plain, (between(X1,X2,X3)|between(X1,X3,X2)|between(X2,X1,X3)|~colinear(X1,X2,X3))). % 0.19/0.46 cnf(i_0_32, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))). % 0.19/0.46 cnf(i_0_29, plain, (X1=X2|between(X1,X3,X4)|between(X1,X4,X3)|~between(X1,X2,X4)|~between(X1,X2,X3))). % 0.19/0.46 cnf(i_0_34, plain, (between(X1,X2,outer_pasch(X2,X3,X4,X1,X5))|~between(X4,X5,X1)|~between(X3,X2,X5))). % 0.19/0.46 cnf(i_0_33, plain, (between(X1,outer_pasch(X2,X1,X3,X4,X5),X3)|~between(X3,X5,X4)|~between(X1,X2,X5))). % 0.19/0.46 cnf(i_0_35, plain, (X1=X2|between(X1,X3,euclid1(X4,X1,X5,X3,X2))|~between(X5,X2,X3)|~between(X1,X2,X4))). % 0.19/0.46 cnf(i_0_36, plain, (X1=X2|between(X1,X3,euclid2(X4,X1,X3,X5,X2))|~between(X3,X2,X5)|~between(X1,X2,X4))). % 0.19/0.46 cnf(i_0_45, plain, (equidistant(X1,X2,X1,continuous(X3,X2,X4,X5,X6,X1))|~equidistant(X1,X4,X1,X6)|~equidistant(X1,X3,X1,X5)|~between(X3,X2,X4)|~between(X1,X3,X4))). % 0.19/0.46 cnf(i_0_37, plain, (X1=X2|between(euclid1(X3,X1,X4,X5,X2),X3,euclid2(X3,X1,X4,X5,X2))|~between(X4,X2,X5)|~between(X1,X2,X3))). % 0.19/0.46 cnf(i_0_46, plain, (between(X1,continuous(X2,X3,X4,X1,X5,X6),X5)|~equidistant(X6,X4,X6,X5)|~equidistant(X6,X2,X6,X1)|~between(X2,X3,X4)|~between(X6,X2,X4))). % 0.19/0.46 cnf(i_0_44, 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.19/0.46 cnf(i_0_38, plain, (X1=X2|equidistant(X3,X4,X5,X6)|~equidistant(X2,X4,X7,X6)|~equidistant(X2,X3,X7,X5)|~equidistant(X1,X4,X8,X6)|~equidistant(X1,X2,X8,X7)|~between(X8,X7,X5)|~between(X1,X2,X3))). % 0.19/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.46 # Begin printing tableau % 0.19/0.46 # Found 9 steps % 0.19/0.46 cnf(i_0_52, negated_conjecture, (~colinear(a,c,b)|~colinear(b,a,c)|~colinear(b,c,a)|~colinear(c,a,b)|~colinear(c,b,a)), inference(start_rule)). % 0.19/0.46 cnf(i_0_53, plain, (~colinear(a,c,b)), inference(extension_rule, [i_0_50])). % 0.19/0.46 cnf(i_0_65, plain, (~between(a,b,c)), inference(extension_rule, [i_0_28])). % 0.19/0.46 cnf(i_0_288, plain, (~between(b,c,extension(b,c,X3,X4))), inference(closure_rule, [i_0_39])). % 0.19/0.46 cnf(i_0_54, plain, (~colinear(b,a,c)), inference(etableau_closure_rule, [i_0_54, ...])). % 0.19/0.46 cnf(i_0_55, plain, (~colinear(b,c,a)), inference(etableau_closure_rule, [i_0_55, ...])). % 0.19/0.46 cnf(i_0_56, plain, (~colinear(c,a,b)), inference(etableau_closure_rule, [i_0_56, ...])). % 0.19/0.46 cnf(i_0_57, plain, (~colinear(c,b,a)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.19/0.46 cnf(i_0_289, plain, (~between(a,b,extension(b,c,X3,X4))), inference(etableau_closure_rule, [i_0_289, ...])). % 0.19/0.46 # End printing tableau % 0.19/0.46 # SZS output end % 0.19/0.46 # Branches closed with saturation will be marked with an "s" % 0.19/0.46 # Child (7001) has found a proof. % 0.19/0.46 % 0.19/0.46 # Proof search is over... % 0.19/0.46 # Freeing feature tree %------------------------------------------------------------------------------