TSTP Solution File: GEO076-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO076-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 : 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:37 EDT 2022
% Result : Unsatisfiable 0.21s 0.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : GEO076-4 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 09:10:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.14/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 33 Number of unprocessed: 33
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 33 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 2 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 31 extension rule candidate clauses
% 0.14/0.39 # 2 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.39 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 16 tableaux to operate on
% 0.21/0.42 # Creating equality axioms
% 0.21/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.42 # There were 1 total branch saturation attempts.
% 0.21/0.42 # There were 0 of these attempts blocked.
% 0.21/0.42 # There were 0 deferred branch saturation attempts.
% 0.21/0.42 # There were 0 free duplicated saturations.
% 0.21/0.42 # There were 1 total successful branch saturations.
% 0.21/0.42 # There were 0 successful branch saturations in interreduction.
% 0.21/0.42 # There were 0 successful branch saturations on the branch.
% 0.21/0.42 # There were 1 successful branch saturations after the branch.
% 0.21/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 # Begin clausification derivation
% 0.21/0.42
% 0.21/0.42 # End clausification derivation
% 0.21/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.42 cnf(i_0_65, hypothesis, (point(a_point))).
% 0.21/0.42 cnf(i_0_45, plain, (line(at_least_one_line))).
% 0.21/0.42 cnf(i_0_66, negated_conjecture, (on(a_point,X1)|~line(X1))).
% 0.21/0.42 cnf(i_0_43, plain, (~line(X1)|~on(point_not_on_line(X1),X1))).
% 0.21/0.42 cnf(i_0_42, plain, (point_2_on_line(X1)!=point_1_on_line(X1)|~line(X1))).
% 0.21/0.42 cnf(i_0_40, plain, (point(point_1_on_line(X1))|~line(X1))).
% 0.21/0.42 cnf(i_0_41, plain, (point(point_2_on_line(X1))|~line(X1))).
% 0.21/0.42 cnf(i_0_48, plain, (~plane(X1)|~on(point_not_on_plane(X1),X1))).
% 0.21/0.42 cnf(i_0_44, plain, (point(point_not_on_line(X1))|~line(X1))).
% 0.21/0.42 cnf(i_0_47, plain, (point(point_on_plane(X1))|~plane(X1))).
% 0.21/0.42 cnf(i_0_49, plain, (point(point_not_on_plane(X1))|~plane(X1))).
% 0.21/0.42 cnf(i_0_38, plain, (on(point_1_on_line(X1),X1)|~line(X1))).
% 0.21/0.42 cnf(i_0_39, plain, (on(point_2_on_line(X1),X1)|~line(X1))).
% 0.21/0.42 cnf(i_0_46, plain, (on(point_on_plane(X1),X1)|~plane(X1))).
% 0.21/0.42 cnf(i_0_36, plain, (X1=X2|line(line_from_to(X1,X2))|~point(X2)|~point(X1))).
% 0.21/0.42 cnf(i_0_35, plain, (X1=X2|on(X1,line_from_to(X2,X1))|~point(X2)|~point(X1))).
% 0.21/0.42 cnf(i_0_34, plain, (X1=X2|on(X1,line_from_to(X1,X2))|~point(X2)|~point(X1))).
% 0.21/0.42 cnf(i_0_59, 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.42 cnf(i_0_58, 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.42 cnf(i_0_57, 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.42 cnf(i_0_56, 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.42 cnf(i_0_63, 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.42 cnf(i_0_53, 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.42 cnf(i_0_37, 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.42 cnf(i_0_62, 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.42 cnf(i_0_61, 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.42 cnf(i_0_60, 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.42 cnf(i_0_55, 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.42 cnf(i_0_52, 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.42 cnf(i_0_51, 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.42 cnf(i_0_50, 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.42 cnf(i_0_64, 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.42 cnf(i_0_54, 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.42 cnf(i_0_594, plain, (X6=X6)).
% 0.21/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.42 # Begin printing tableau
% 0.21/0.42 # Found 5 steps
% 0.21/0.42 cnf(i_0_594, plain, (X6=X6), inference(start_rule)).
% 0.21/0.42 cnf(i_0_789, plain, (X6=X6), inference(extension_rule, [i_0_598])).
% 0.21/0.42 cnf(i_0_974, plain, ($false), inference(closure_rule, [i_0_594])).
% 0.21/0.42 cnf(i_0_972, plain, (line_from_to(X6,X5)=line_from_to(X6,X5)), inference(extension_rule, [i_0_602])).
% 0.21/0.42 cnf(i_0_4429, plain, (point_1_on_line(line_from_to(X6,X5))=point_1_on_line(line_from_to(X6,X5))), inference(etableau_closure_rule, [i_0_4429, ...])).
% 0.21/0.42 # End printing tableau
% 0.21/0.42 # SZS output end
% 0.21/0.42 # Branches closed with saturation will be marked with an "s"
% 0.21/0.42 # Creating equality axioms
% 0.21/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.42 # Creating equality axioms
% 0.21/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.42 # Creating equality axioms
% 0.21/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.42 # Child (31390) has found a proof.
% 0.21/0.42
% 0.21/0.43 # Proof search is over...
% 0.21/0.43 # Freeing feature tree
%------------------------------------------------------------------------------