TSTP Solution File: GEO011-5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO011-5 : 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 : n021.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:07 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO011-5 : 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.13/0.33 % Computer : n021.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 17:27:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.13/0.36 # and selection function SelectNewComplexAHPNS.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 7 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 10 extension rule candidate clauses
% 0.13/0.36 # 7 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
% 0.13/0.36 # There were 0 total branch saturation attempts.
% 0.13/0.36 # There were 0 of these attempts blocked.
% 0.13/0.36 # There were 0 deferred branch saturation attempts.
% 0.13/0.36 # There were 0 free duplicated saturations.
% 0.13/0.36 # There were 0 total successful branch saturations.
% 0.13/0.36 # There were 0 successful branch saturations in interreduction.
% 0.13/0.36 # There were 0 successful branch saturations on the branch.
% 0.13/0.36 # There were 0 successful branch saturations after the branch.
% 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 # Begin clausification derivation
% 0.13/0.36
% 0.13/0.36 # End clausification derivation
% 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.36 cnf(i_0_34, negated_conjecture, (colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.13/0.36 cnf(i_0_22, plain, (equal_distance(distance(X1,X2),distance(X2,X1)))).
% 0.13/0.36 cnf(i_0_25, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.13/0.36 cnf(i_0_26, plain, (equal_distance(distance(X1,extension(X2,X1,X3,X4)),distance(X3,X4)))).
% 0.13/0.36 cnf(i_0_31, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.13/0.36 cnf(i_0_32, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.13/0.36 cnf(i_0_33, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.13/0.36 cnf(i_0_28, plain, (X1=X2|~between(X1,X2,X1))).
% 0.13/0.36 cnf(i_0_19, plain, (colinear(X1,X2,X3)|~between(X2,X3,X1))).
% 0.13/0.36 cnf(i_0_20, plain, (colinear(X1,X2,X3)|~between(X3,X1,X2))).
% 0.13/0.36 cnf(i_0_24, plain, (X1=X2|~equal_distance(distance(X1,X2),distance(X3,X3)))).
% 0.13/0.36 cnf(i_0_18, plain, (colinear(X1,X2,X3)|~between(X1,X2,X3))).
% 0.13/0.36 cnf(i_0_21, plain, (between(X1,X2,X3)|between(X2,X3,X1)|between(X3,X1,X2)|~colinear(X1,X2,X3))).
% 0.13/0.36 cnf(i_0_30, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 0.13/0.36 cnf(i_0_29, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 0.13/0.36 cnf(i_0_23, plain, (equal_distance(distance(X1,X2),distance(X3,X4))|~equal_distance(distance(X5,X6),distance(X3,X4))|~equal_distance(distance(X5,X6),distance(X1,X2)))).
% 0.13/0.36 cnf(i_0_27, plain, (X1=X2|equal_distance(distance(X3,X4),distance(X5,X6))|~equal_distance(distance(X2,X4),distance(X7,X6))|~equal_distance(distance(X2,X3),distance(X7,X5))|~equal_distance(distance(X1,X4),distance(X8,X6))|~equal_distance(distance(X1,X2),distance(X8,X7))|~between(X8,X7,X5)|~between(X1,X2,X3))).
% 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 5 steps
% 0.13/0.37 cnf(i_0_34, negated_conjecture, (colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_35, plain, (colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3)), inference(extension_rule, [i_0_21])).
% 0.13/0.37 cnf(i_0_46, plain, (between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3)), inference(closure_rule, [i_0_31])).
% 0.13/0.37 cnf(i_0_47, plain, (between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1)), inference(closure_rule, [i_0_32])).
% 0.13/0.37 cnf(i_0_48, plain, (between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2)), inference(closure_rule, [i_0_33])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 1 tableaux to operate on
% 0.13/0.37 # Found closed tableau during pool population.
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------