%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO077-4 : 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:38 EDT 2022 % Result : Unsatisfiable 0.21s 0.41s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : GEO077-4 : TPTP v8.1.0. Released v1.0.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n015.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.36 % WCLimit : 600 % 0.13/0.36 % DateTime : Sat Jun 18 12:56:43 EDT 2022 % 0.13/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 42 Number of unprocessed: 42 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.40 # The folding up rule is enabled... % 0.21/0.40 # Local unification is enabled... % 0.21/0.40 # Any saturation attempts will use folding labels... % 0.21/0.40 # 42 beginning clauses after preprocessing and clausification % 0.21/0.40 # Creating start rules for all 1 conjectures. % 0.21/0.40 # There are 1 start rule candidates: % 0.21/0.40 # Found 12 unit axioms. % 0.21/0.40 # 1 start rule tableaux created. % 0.21/0.40 # 30 extension rule candidate clauses % 0.21/0.40 # 12 unit axiom clauses % 0.21/0.40 % 0.21/0.40 # Requested 8, 32 cores available to the main process. % 0.21/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.41 # There were 1 total branch saturation attempts. % 0.21/0.41 # There were 0 of these attempts blocked. % 0.21/0.41 # There were 0 deferred branch saturation attempts. % 0.21/0.41 # There were 0 free duplicated saturations. % 0.21/0.41 # There were 1 total successful branch saturations. % 0.21/0.41 # There were 0 successful branch saturations in interreduction. % 0.21/0.41 # There were 0 successful branch saturations on the branch. % 0.21/0.41 # There were 1 successful branch saturations after the branch. % 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # Begin clausification derivation % 0.21/0.41 % 0.21/0.41 # End clausification derivation % 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.41 cnf(i_0_84, negated_conjecture, (collinear(point1,point2,point3))). % 0.21/0.41 cnf(i_0_74, hypothesis, (point(point1))). % 0.21/0.41 cnf(i_0_75, hypothesis, (point(point2))). % 0.21/0.41 cnf(i_0_76, hypothesis, (point(point3))). % 0.21/0.41 cnf(i_0_54, plain, (line(at_least_one_line))). % 0.21/0.41 cnf(i_0_77, hypothesis, (line(a_line))). % 0.21/0.41 cnf(i_0_78, hypothesis, (on(point1,a_line))). % 0.21/0.41 cnf(i_0_79, hypothesis, (on(point2,a_line))). % 0.21/0.41 cnf(i_0_81, hypothesis, (point1!=point2)). % 0.21/0.41 cnf(i_0_82, hypothesis, (point1!=point3)). % 0.21/0.41 cnf(i_0_83, hypothesis, (point3!=point2)). % 0.21/0.41 cnf(i_0_80, hypothesis, (~on(point3,a_line))). % 0.21/0.41 cnf(i_0_51, plain, (point_2_on_line(X1)!=point_1_on_line(X1)|~line(X1))). % 0.21/0.41 cnf(i_0_52, plain, (~line(X1)|~on(point_not_on_line(X1),X1))). % 0.21/0.41 cnf(i_0_57, plain, (~plane(X1)|~on(point_not_on_plane(X1),X1))). % 0.21/0.41 cnf(i_0_49, plain, (point(point_1_on_line(X1))|~line(X1))). % 0.21/0.41 cnf(i_0_50, plain, (point(point_2_on_line(X1))|~line(X1))). % 0.21/0.41 cnf(i_0_53, plain, (point(point_not_on_line(X1))|~line(X1))). % 0.21/0.41 cnf(i_0_56, plain, (point(point_on_plane(X1))|~plane(X1))). % 0.21/0.41 cnf(i_0_58, plain, (point(point_not_on_plane(X1))|~plane(X1))). % 0.21/0.41 cnf(i_0_47, plain, (on(point_1_on_line(X1),X1)|~line(X1))). % 0.21/0.41 cnf(i_0_48, plain, (on(point_2_on_line(X1),X1)|~line(X1))). % 0.21/0.41 cnf(i_0_55, plain, (on(point_on_plane(X1),X1)|~plane(X1))). % 0.21/0.41 cnf(i_0_45, plain, (X1=X2|line(line_from_to(X1,X2))|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_44, plain, (X1=X2|on(X1,line_from_to(X2,X1))|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_43, plain, (X1=X2|on(X1,line_from_to(X1,X2))|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_68, plain, (X1=X2|common_point_on_planes(X1,X2,X3)!=X3|~plane(X2)|~plane(X1)|~point(X3)|~on(X3,X2)|~on(X3,X1))). % 0.21/0.41 cnf(i_0_46, plain, (X1=X2|X3=X4|~line(X4)|~line(X3)|~point(X2)|~point(X1)|~on(X2,X4)|~on(X2,X3)|~on(X1,X4)|~on(X1,X3))). % 0.21/0.41 cnf(i_0_67, plain, (X1=X2|point(common_point_on_planes(X1,X2,X3))|~plane(X2)|~plane(X1)|~point(X3)|~on(X3,X2)|~on(X3,X1))). % 0.21/0.41 cnf(i_0_66, plain, (X1=X2|on(common_point_on_planes(X1,X2,X3),X2)|~plane(X2)|~plane(X1)|~point(X3)|~on(X3,X2)|~on(X3,X1))). % 0.21/0.41 cnf(i_0_65, plain, (X1=X2|on(common_point_on_planes(X1,X2,X3),X1)|~plane(X2)|~plane(X1)|~point(X3)|~on(X3,X2)|~on(X3,X1))). % 0.21/0.41 cnf(i_0_72, plain, (X1=X2|X1=X3|X2=X3|line(line_through_3_points(X1,X2,X3))|~collinear(X1,X2,X3)|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_71, plain, (X1=X2|X1=X3|X2=X3|on(X3,line_through_3_points(X1,X2,X3))|~collinear(X1,X2,X3)|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_62, plain, (X1=X2|X1=X3|X2=X3|collinear(X1,X2,X3)|plane(plane_for_points(X1,X2,X3))|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_70, plain, (X1=X2|X1=X3|X2=X3|on(X2,line_through_3_points(X1,X2,X3))|~collinear(X1,X2,X3)|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_69, plain, (X1=X2|X1=X3|X2=X3|on(X1,line_through_3_points(X1,X2,X3))|~collinear(X1,X2,X3)|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_61, plain, (X1=X2|X1=X3|X2=X3|collinear(X2,X3,X1)|on(X1,plane_for_points(X2,X3,X1))|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_60, plain, (X1=X2|X1=X3|X2=X3|collinear(X2,X1,X3)|on(X1,plane_for_points(X2,X1,X3))|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_64, plain, (X1=X2|on(X3,X4)|~plane(X4)|~line(X3)|~point(X2)|~point(X1)|~on(X2,X4)|~on(X2,X3)|~on(X1,X4)|~on(X1,X3))). % 0.21/0.41 cnf(i_0_59, plain, (X1=X2|X1=X3|X2=X3|collinear(X1,X2,X3)|on(X1,plane_for_points(X1,X2,X3))|~point(X3)|~point(X2)|~point(X1))). % 0.21/0.41 cnf(i_0_73, plain, (X1=X2|X1=X3|X2=X3|collinear(X1,X2,X3)|~line(X4)|~point(X3)|~point(X2)|~point(X1)|~on(X3,X4)|~on(X2,X4)|~on(X1,X4))). % 0.21/0.41 cnf(i_0_63, plain, (X1=X2|X1=X3|X2=X3|X4=X5|collinear(X1,X2,X3)|~plane(X5)|~plane(X4)|~point(X3)|~point(X2)|~point(X1)|~on(X3,X5)|~on(X3,X4)|~on(X2,X5)|~on(X2,X4)|~on(X1,X5)|~on(X1,X4))). % 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.41 # Begin printing tableau % 0.21/0.41 # Found 10 steps % 0.21/0.41 cnf(i_0_84, negated_conjecture, (collinear(point1,point2,point3)), inference(start_rule)). % 0.21/0.41 cnf(i_0_85, plain, (collinear(point1,point2,point3)), inference(extension_rule, [i_0_72])). % 0.21/0.41 cnf(i_0_158, plain, (point1=point2), inference(closure_rule, [i_0_81])). % 0.21/0.41 cnf(i_0_159, plain, (point1=point3), inference(closure_rule, [i_0_82])). % 0.21/0.41 cnf(i_0_160, plain, (point3=point2), inference(closure_rule, [i_0_83])). % 0.21/0.41 cnf(i_0_163, plain, (~point(point3)), inference(closure_rule, [i_0_76])). % 0.21/0.41 cnf(i_0_164, plain, (~point(point2)), inference(closure_rule, [i_0_75])). % 0.21/0.41 cnf(i_0_165, plain, (~point(point1)), inference(closure_rule, [i_0_74])). % 0.21/0.41 cnf(i_0_161, plain, (line(line_through_3_points(point1,point2,point3))), inference(extension_rule, [i_0_51])). % 0.21/0.41 cnf(i_0_778, plain, (point_2_on_line(line_through_3_points(point1,point2,point3))!=point_1_on_line(line_through_3_points(point1,point2,point3))), inference(etableau_closure_rule, [i_0_778, ...])). % 0.21/0.41 # End printing tableau % 0.21/0.41 # SZS output end % 0.21/0.41 # Branches closed with saturation will be marked with an "s" % 0.21/0.41 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.21/0.41 # We now have 1 tableaux to operate on % 0.21/0.41 # Found closed tableau during pool population. % 0.21/0.41 # Proof search is over... % 0.21/0.41 # Freeing feature tree %------------------------------------------------------------------------------