TSTP Solution File: GEO008-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO008-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n026.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:04 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO008-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 04:21:39 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 82 Number of unprocessed: 73
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.38 # The folding up rule is enabled...
% 0.20/0.38 # Local unification is enabled...
% 0.20/0.38 # Any saturation attempts will use folding labels...
% 0.20/0.38 # 73 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 1 conjectures.
% 0.20/0.38 # There are 1 start rule candidates:
% 0.20/0.38 # Found 22 unit axioms.
% 0.20/0.38 # 1 start rule tableaux created.
% 0.20/0.38 # 51 extension rule candidate clauses
% 0.20/0.38 # 22 unit axiom clauses
% 0.20/0.38
% 0.20/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 21 tableaux to operate on
% 0.20/0.49 # There were 2 total branch saturation attempts.
% 0.20/0.49 # There were 0 of these attempts blocked.
% 0.20/0.49 # There were 0 deferred branch saturation attempts.
% 0.20/0.49 # There were 0 free duplicated saturations.
% 0.20/0.49 # There were 2 total successful branch saturations.
% 0.20/0.49 # There were 0 successful branch saturations in interreduction.
% 0.20/0.49 # There were 0 successful branch saturations on the branch.
% 0.20/0.49 # There were 2 successful branch saturations after the branch.
% 0.20/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Begin clausification derivation
% 0.20/0.49
% 0.20/0.49 # End clausification derivation
% 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.49 cnf(i_0_167, hypothesis, (between(a,c,e))).
% 0.20/0.49 cnf(i_0_168, hypothesis, (between(a,d,e))).
% 0.20/0.49 cnf(i_0_169, hypothesis, (between(c,b,d))).
% 0.20/0.49 cnf(i_0_130, plain, (between(X1,X2,X2))).
% 0.20/0.49 cnf(i_0_133, plain, (between(X1,X1,X2))).
% 0.20/0.49 cnf(i_0_86, plain, (equidistant(X1,X2,X2,X1))).
% 0.20/0.49 cnf(i_0_106, plain, (equidistant(X1,X2,X1,X2))).
% 0.20/0.49 cnf(i_0_122, plain, (equidistant(X1,X1,X2,X2))).
% 0.20/0.49 cnf(i_0_115, plain, (extension(X1,X2,X3,X3)=X2)).
% 0.20/0.49 cnf(i_0_89, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.20/0.49 cnf(i_0_90, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.20/0.49 cnf(i_0_148, plain, (equidistant(X1,extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X3,extension(X4,X3,lower_dimension_point_1,lower_dimension_point_2)))).
% 0.20/0.49 cnf(i_0_156, plain, (equidistant(X1,X2,X3,extension(extension(X4,X3,lower_dimension_point_1,lower_dimension_point_2),X3,X1,X2)))).
% 0.20/0.49 cnf(i_0_129, plain, (extension(extension(X1,X2,X1,X2),X2,extension(X1,X2,X1,X2),X2)=X1)).
% 0.20/0.49 cnf(i_0_144, plain, (lower_dimension_point_2!=lower_dimension_point_1)).
% 0.20/0.49 cnf(i_0_170, negated_conjecture, (~between(a,b,e))).
% 0.20/0.49 cnf(i_0_146, plain, (lower_dimension_point_3!=lower_dimension_point_1)).
% 0.20/0.49 cnf(i_0_145, plain, (lower_dimension_point_3!=lower_dimension_point_2)).
% 0.20/0.49 cnf(i_0_95, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.20/0.49 cnf(i_0_96, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.20/0.49 cnf(i_0_97, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.20/0.49 cnf(i_0_147, plain, (extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2)!=X2)).
% 0.20/0.49 cnf(i_0_92, plain, (X1=X2|~between(X1,X2,X1))).
% 0.20/0.49 cnf(i_0_88, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.20/0.49 cnf(i_0_132, plain, (between(X1,X2,X3)|~between(X3,X2,X1))).
% 0.20/0.49 cnf(i_0_121, plain, (X1=X2|extension(X2,X1,X2,X1)!=X1)).
% 0.20/0.49 cnf(i_0_135, plain, (X1=X2|~between(X3,X2,X1)|~between(X3,X1,X2))).
% 0.20/0.49 cnf(i_0_134, plain, (X1=X2|~between(X2,X1,X3)|~between(X1,X2,X3))).
% 0.20/0.49 cnf(i_0_131, plain, (between(X1,X2,X3)|~between(X3,X2,X3))).
% 0.20/0.49 cnf(i_0_113, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X2,X1))).
% 0.20/0.49 cnf(i_0_112, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X2,X1))).
% 0.20/0.49 cnf(i_0_139, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X4,X1,X2))).
% 0.20/0.49 cnf(i_0_142, plain, (between(X1,X2,X3)|~between(X4,X2,X3)|~between(X1,X4,X3))).
% 0.20/0.49 cnf(i_0_143, plain, (between(X1,X2,X3)|~between(X1,X4,X3)|~between(X1,X2,X4))).
% 0.20/0.49 cnf(i_0_111, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X1,X2))).
% 0.20/0.49 cnf(i_0_107, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X1,X2))).
% 0.20/0.49 cnf(i_0_110, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X4,X3))).
% 0.20/0.49 cnf(i_0_108, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X3,X4))).
% 0.20/0.49 cnf(i_0_125, plain, (extension(X1,X2,X2,X3)=X3|X1=X2|~between(X1,X2,X3))).
% 0.20/0.49 cnf(i_0_109, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X1,X2,X4,X3))).
% 0.20/0.49 cnf(i_0_140, plain, (X1=X2|between(X3,X2,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))).
% 0.20/0.49 cnf(i_0_141, plain, (X1=X2|between(X3,X1,X4)|~between(X1,X2,X4)|~between(X3,X1,X2))).
% 0.20/0.49 cnf(i_0_166, plain, (between(X1,X2,X3)|between(X2,X1,X3)|~between(X4,X2,X3)|~between(X4,X1,X3))).
% 0.20/0.49 cnf(i_0_127, plain, (extension(X1,X2,X1,X2)=extension(X1,X2,X2,X1)|X1=X2)).
% 0.20/0.49 cnf(i_0_155, plain, (X1=X2|~between(X3,X1,X4)|~equidistant(X4,X1,X4,X2)|~equidistant(X3,X1,X3,X2))).
% 0.20/0.49 cnf(i_0_124, plain, (X1=X2|X3=X4|~between(X1,X2,X4)|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4))).
% 0.20/0.49 cnf(i_0_87, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 0.20/0.49 cnf(i_0_114, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X1,X2,X5,X6))).
% 0.20/0.49 cnf(i_0_159, plain, (extension(extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2),X2,X2,X3)=X3|~between(X2,X3,X1))).
% 0.20/0.49 cnf(i_0_165, plain, (between(X1,X2,X3)|between(X1,X3,X2)|~between(X1,X3,X4)|~between(X1,X2,X4))).
% 0.20/0.49 cnf(i_0_94, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 0.20/0.49 cnf(i_0_93, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 0.20/0.49 cnf(i_0_151, plain, (X1=X2|X3=X4|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4)|~equidistant(X1,X3,X1,X4))).
% 0.20/0.49 cnf(i_0_164, plain, (X1=X2|between(X3,X4,X1)|between(X4,X3,X1)|~between(X4,X1,X2)|~between(X3,X1,X2))).
% 0.20/0.49 cnf(i_0_100, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))).
% 0.20/0.49 cnf(i_0_99, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 0.20/0.49 cnf(i_0_161, plain, (between(X1,X2,X3)|~between(X4,X5,X6)|~equidistant(X5,X6,X2,X3)|~equidistant(X4,X6,X1,X3)|~equidistant(X4,X5,X1,X2))).
% 0.20/0.49 cnf(i_0_163, plain, (X1=X2|between(X2,X3,X4)|between(X2,X4,X3)|~between(X1,X2,X4)|~between(X1,X2,X3))).
% 0.20/0.49 cnf(i_0_162, plain, (X1=X2|between(X1,X3,X4)|between(X1,X4,X3)|~between(X1,X2,X4)|~between(X1,X2,X3))).
% 0.20/0.49 cnf(i_0_126, plain, (extension(X1,X2,X3,X4)=extension(X1,X2,X5,X6)|X1=X2|~equidistant(X3,X4,X5,X6))).
% 0.20/0.49 cnf(i_0_153, plain, (equidistant(X1,X2,X3,X4)|~between(X5,X3,X4)|~between(X6,X1,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X6,X1,X5,X3))).
% 0.20/0.49 cnf(i_0_123, plain, (equidistant(X1,X2,X3,X4)|~between(X3,X5,X4)|~between(X1,X6,X2)|~equidistant(X6,X2,X5,X4)|~equidistant(X1,X6,X3,X5))).
% 0.20/0.49 cnf(i_0_103, 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))).
% 0.20/0.49 cnf(i_0_158, plain, (equidistant(X1,X2,extension(extension(X3,X4,lower_dimension_point_1,lower_dimension_point_2),X4,X5,X1),X3)|~between(X5,X1,X2)|~equidistant(X5,X2,X4,X3))).
% 0.20/0.49 cnf(i_0_157, plain, (between(X1,extension(extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X1,X3,X4),X2)|~between(X3,X4,X5)|~equidistant(X3,X5,X1,X2))).
% 0.20/0.49 cnf(i_0_102, 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))).
% 0.20/0.49 cnf(i_0_101, 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))).
% 0.20/0.49 cnf(i_0_98, 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.20/0.49 cnf(i_0_160, plain, (extension(extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2),X2,X3,X4)=extension(extension(X1,X2,lower_dimension_point_1,lower_dimension_point_2),X2,X5,X6)|~equidistant(X3,X4,X5,X6))).
% 0.20/0.49 cnf(i_0_154, plain, (equidistant(X1,X2,X3,X4)|~between(X5,X3,X6)|~between(X7,X1,X8)|~equidistant(X8,X2,X6,X4)|~equidistant(X1,X8,X3,X6)|~equidistant(X7,X2,X5,X4)|~equidistant(X7,X1,X5,X3))).
% 0.20/0.49 cnf(i_0_152, plain, (equidistant(X1,X2,X3,X4)|~between(X5,X3,X6)|~between(X7,X1,X8)|~equidistant(X8,X2,X6,X4)|~equidistant(X7,X2,X5,X4)|~equidistant(X7,X8,X5,X6)|~equidistant(X7,X1,X5,X3))).
% 0.20/0.49 cnf(i_0_91, 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))).
% 0.20/0.49 cnf(i_0_150, plain, (between(X1,inner_pasch(X2,inner_pasch(X3,X4,X5,X2,X6),X3,X1,X6),X2)|between(X4,inner_pasch(X2,inner_pasch(X3,X4,X5,X2,X6),X3,X1,X6),X6)|~between(X5,X2,X6)|~between(X3,X4,X5)|~between(X3,X1,X6))).
% 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.49 # Begin printing tableau
% 0.20/0.49 # Found 11 steps
% 0.20/0.49 cnf(i_0_170, negated_conjecture, (~between(a,b,e)), inference(start_rule)).
% 0.20/0.49 cnf(i_0_174, plain, (~between(a,b,e)), inference(extension_rule, [i_0_163])).
% 0.20/0.49 cnf(i_0_281, plain, (extension(b,a,lower_dimension_point_1,lower_dimension_point_2)=a), inference(closure_rule, [i_0_147])).
% 0.20/0.49 cnf(i_0_283, plain, (between(a,e,b)), inference(extension_rule, [i_0_132])).
% 0.20/0.49 cnf(i_0_364, plain, (between(b,e,a)), inference(etableau_closure_rule, [i_0_364, ...])).
% 0.20/0.49 cnf(i_0_284, plain, (~between(extension(b,a,lower_dimension_point_1,lower_dimension_point_2),a,e)), inference(extension_rule, [i_0_131])).
% 0.20/0.49 cnf(i_0_2474, plain, (~between(e,a,e)), inference(extension_rule, [i_0_139])).
% 0.20/0.49 cnf(i_0_2492, plain, (~between(a,a,e)), inference(closure_rule, [i_0_133])).
% 0.20/0.49 cnf(i_0_285, plain, (~between(extension(b,a,lower_dimension_point_1,lower_dimension_point_2),a,b)), inference(extension_rule, [i_0_132])).
% 0.20/0.49 cnf(i_0_4936, plain, (~between(b,a,extension(b,a,lower_dimension_point_1,lower_dimension_point_2))), inference(closure_rule, [i_0_89])).
% 0.20/0.49 cnf(i_0_2493, plain, (~between(a,e,a)), inference(etableau_closure_rule, [i_0_2493, ...])).
% 0.20/0.49 # End printing tableau
% 0.20/0.49 # SZS output end
% 0.20/0.49 # Branches closed with saturation will be marked with an "s"
% 0.20/0.49 # Child (12036) has found a proof.
% 0.20/0.49
% 0.20/0.49 # Proof search is over...
% 0.20/0.49 # Freeing feature tree
%------------------------------------------------------------------------------