TSTP Solution File: GEO060-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO060-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 : n014.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:31 EDT 2022
% Result : Unsatisfiable 143.45s 18.57s
% Output : CNFRefutation 143.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GEO060-2 : TPTP v8.1.0. Released v1.0.0.
% 0.14/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 : n014.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.20/0.36 % CPULimit : 300
% 0.20/0.36 % WCLimit : 600
% 0.20/0.36 % DateTime : Fri Jun 17 19:25:49 EDT 2022
% 0.20/0.36 % CPUTime :
% 0.20/0.39 # No SInE strategy applied
% 0.20/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.39 # and selection function SelectNewComplexAHP.
% 0.20/0.39 #
% 0.20/0.39 # Presaturation interreduction done
% 0.20/0.39 # Number of axioms: 19 Number of unprocessed: 19
% 0.20/0.39 # Tableaux proof search.
% 0.20/0.39 # APR header successfully linked.
% 0.20/0.39 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 19 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 1 conjectures.
% 0.20/0.39 # There are 1 start rule candidates:
% 0.20/0.39 # Found 7 unit axioms.
% 0.20/0.39 # 1 start rule tableaux created.
% 0.20/0.39 # 12 extension rule candidate clauses
% 0.20/0.39 # 7 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 12 tableaux to operate on
% 143.45/18.57 # There were 7 total branch saturation attempts.
% 143.45/18.57 # There were 0 of these attempts blocked.
% 143.45/18.57 # There were 0 deferred branch saturation attempts.
% 143.45/18.57 # There were 0 free duplicated saturations.
% 143.45/18.57 # There were 5 total successful branch saturations.
% 143.45/18.57 # There were 0 successful branch saturations in interreduction.
% 143.45/18.57 # There were 0 successful branch saturations on the branch.
% 143.45/18.57 # There were 5 successful branch saturations after the branch.
% 143.45/18.57 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 143.45/18.57 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 143.45/18.57 # Begin clausification derivation
% 143.45/18.57
% 143.45/18.57 # End clausification derivation
% 143.45/18.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 143.45/18.57 cnf(i_0_21, plain, (equidistant(X1,X2,X2,X1))).
% 143.45/18.57 cnf(i_0_24, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 143.45/18.57 cnf(i_0_25, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 143.45/18.57 cnf(i_0_30, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 143.45/18.57 cnf(i_0_40, negated_conjecture, (extension(extension(u,v,u,v),v,extension(u,v,u,v),v)!=u)).
% 143.45/18.57 cnf(i_0_31, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 143.45/18.57 cnf(i_0_32, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 143.45/18.57 cnf(i_0_27, plain, (X1=X2|~between(X1,X2,X1))).
% 143.45/18.57 cnf(i_0_23, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 143.45/18.57 cnf(i_0_22, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 143.45/18.58 cnf(i_0_29, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 143.45/18.58 cnf(i_0_28, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 143.45/18.58 cnf(i_0_35, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))).
% 143.45/18.58 cnf(i_0_34, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 143.45/18.58 cnf(i_0_36, plain, (X1=X2|between(euclid1(X1,X3,X2,X4,X5),X5,euclid2(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 143.45/18.58 cnf(i_0_38, plain, (equidistant(X1,X2,X1,continuous(X1,X3,X4,X2,X5,X6))|~between(X3,X2,X5)|~between(X1,X3,X5)|~equidistant(X1,X5,X1,X6)|~equidistant(X1,X3,X1,X4))).
% 143.45/18.58 cnf(i_0_33, 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))).
% 143.45/18.58 cnf(i_0_37, plain, (between(X1,continuous(X2,X3,X1,X4,X5,X6),X6)|~between(X3,X4,X5)|~between(X2,X3,X5)|~equidistant(X2,X5,X2,X6)|~equidistant(X2,X3,X2,X1))).
% 143.45/18.58 cnf(i_0_26, plain, (X1=X2|equidistant(X3,X4,X5,X6)|~between(X7,X8,X5)|~between(X1,X2,X3)|~equidistant(X2,X4,X8,X6)|~equidistant(X2,X3,X8,X5)|~equidistant(X1,X4,X7,X6)|~equidistant(X1,X2,X7,X8))).
% 143.45/18.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 143.45/18.58 # Begin printing tableau
% 143.45/18.58 # Found 10 steps
% 143.45/18.58 cnf(i_0_40, negated_conjecture, (extension(extension(u,v,u,v),v,extension(u,v,u,v),v)!=u), inference(start_rule)).
% 143.45/18.58 cnf(i_0_41, plain, (extension(extension(u,v,u,v),v,extension(u,v,u,v),v)!=u), inference(extension_rule, [i_0_23])).
% 143.45/18.58 cnf(i_0_45, plain, (~equidistant(extension(extension(u,v,u,v),v,extension(u,v,u,v),v),u,extension(u,v,u,v),extension(u,v,u,v))), inference(extension_rule, [i_0_26])).
% 143.45/18.58 cnf(i_0_1057884, plain, (~between(u,v,extension(u,v,u,v))), inference(closure_rule, [i_0_24])).
% 143.45/18.58 cnf(i_0_1057885, plain, (~between(extension(u,v,u,v),v,extension(extension(u,v,u,v),v,extension(u,v,u,v),v))), inference(closure_rule, [i_0_24])).
% 143.45/18.58 cnf(i_0_1057888, plain, (~equidistant(extension(u,v,u,v),u,u,extension(u,v,u,v))), inference(closure_rule, [i_0_21])).
% 143.45/18.58 cnf(i_0_1057886, plain, (~equidistant(v,u,v,extension(u,v,u,v))), inference(etableau_closure_rule, [i_0_1057886, ...])).
% 143.45/18.58 cnf(i_0_1057887, plain, (~equidistant(v,extension(extension(u,v,u,v),v,extension(u,v,u,v),v),v,extension(u,v,u,v))), inference(etableau_closure_rule, [i_0_1057887, ...])).
% 143.45/18.58 cnf(i_0_1057889, plain, (~equidistant(extension(u,v,u,v),v,u,v)), inference(etableau_closure_rule, [i_0_1057889, ...])).
% 143.45/18.58 cnf(i_0_1057882, plain, (extension(u,v,u,v)=v), inference(etableau_closure_rule, [i_0_1057882, ...])).
% 143.45/18.58 # End printing tableau
% 143.45/18.58 # SZS output end
% 143.45/18.58 # Branches closed with saturation will be marked with an "s"
% 143.45/18.60 # Child (7251) has found a proof.
% 143.45/18.60
% 143.45/18.60 # Proof search is over...
% 143.45/18.60 # Freeing feature tree
%------------------------------------------------------------------------------