TSTP Solution File: GEO001-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO001-3 : 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 : n007.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:06:59 EDT 2022
% Result : Unsatisfiable 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 07:00:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 46 Number of unprocessed: 40
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 40 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 13 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 27 extension rule candidate clauses
% 0.12/0.37 # 13 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.40 # There were 9 total branch saturation attempts.
% 0.12/0.40 # There were 0 of these attempts blocked.
% 0.12/0.40 # There were 0 deferred branch saturation attempts.
% 0.12/0.40 # There were 5 free duplicated saturations.
% 0.12/0.40 # There were 9 total successful branch saturations.
% 0.12/0.40 # There were 0 successful branch saturations in interreduction.
% 0.12/0.40 # There were 0 successful branch saturations on the branch.
% 0.12/0.40 # There were 4 successful branch saturations after the branch.
% 0.12/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 # Begin clausification derivation
% 0.12/0.40
% 0.12/0.40 # End clausification derivation
% 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.40 cnf(i_0_93, hypothesis, (between(a,b,c))).
% 0.12/0.40 cnf(i_0_91, plain, (between(X1,X2,X2))).
% 0.12/0.40 cnf(i_0_48, plain, (equidistant(X1,X2,X2,X1))).
% 0.12/0.40 cnf(i_0_67, plain, (equidistant(X1,X2,X1,X2))).
% 0.12/0.40 cnf(i_0_83, plain, (equidistant(X1,X1,X2,X2))).
% 0.12/0.40 cnf(i_0_76, plain, (extension(X1,X2,X3,X3)=X2)).
% 0.12/0.40 cnf(i_0_51, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.12/0.40 cnf(i_0_52, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.12/0.40 cnf(i_0_90, plain, (extension(extension(X1,X2,X1,X2),X2,extension(X1,X2,X1,X2),X2)=X1)).
% 0.12/0.40 cnf(i_0_94, negated_conjecture, (~between(c,b,a))).
% 0.12/0.40 cnf(i_0_57, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.12/0.40 cnf(i_0_58, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.12/0.40 cnf(i_0_59, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.12/0.40 cnf(i_0_54, plain, (X1=X2|~between(X1,X2,X1))).
% 0.12/0.40 cnf(i_0_50, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.12/0.40 cnf(i_0_82, plain, (X1=X2|extension(X2,X1,X2,X1)!=X1)).
% 0.12/0.40 cnf(i_0_86, plain, (extension(X1,X2,X2,X3)=X3|X1=X2|~between(X1,X2,X3))).
% 0.12/0.40 cnf(i_0_74, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X2,X1))).
% 0.12/0.40 cnf(i_0_73, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X2,X1))).
% 0.12/0.40 cnf(i_0_72, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X4,X3,X1,X2))).
% 0.12/0.40 cnf(i_0_68, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X3,X4,X1,X2))).
% 0.12/0.40 cnf(i_0_71, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X4,X3))).
% 0.12/0.40 cnf(i_0_69, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X2,X1,X3,X4))).
% 0.12/0.40 cnf(i_0_70, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X1,X2,X4,X3))).
% 0.12/0.40 cnf(i_0_88, plain, (extension(X1,X2,X1,X2)=extension(X1,X2,X2,X1)|X1=X2)).
% 0.12/0.40 cnf(i_0_85, plain, (X1=X2|X3=X4|~between(X1,X2,X4)|~between(X1,X2,X3)|~equidistant(X2,X3,X2,X4))).
% 0.12/0.40 cnf(i_0_49, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 0.12/0.40 cnf(i_0_75, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X1,X2,X5,X6))).
% 0.12/0.40 cnf(i_0_56, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 0.12/0.40 cnf(i_0_55, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 0.12/0.40 cnf(i_0_62, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))).
% 0.12/0.40 cnf(i_0_61, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 0.12/0.40 cnf(i_0_87, plain, (extension(X1,X2,X3,X4)=extension(X1,X2,X5,X6)|X1=X2|~equidistant(X3,X4,X5,X6))).
% 0.12/0.40 cnf(i_0_84, 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.12/0.40 cnf(i_0_65, 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.12/0.40 cnf(i_0_64, 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.12/0.40 cnf(i_0_63, 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.12/0.40 cnf(i_0_60, 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.12/0.40 cnf(i_0_53, 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.12/0.40 cnf(i_0_92, plain, (between(X1,X2,X3)|~between(X3,X2,X3))).
% 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.40 # Begin printing tableau
% 0.12/0.40 # Found 9 steps
% 0.12/0.40 cnf(i_0_94, negated_conjecture, (~between(c,b,a)), inference(start_rule)).
% 0.12/0.40 cnf(i_0_98, plain, (~between(c,b,a)), inference(extension_rule, [i_0_92])).
% 0.12/0.40 cnf(i_0_187, plain, (~between(a,b,a)), inference(extension_rule, [i_0_60])).
% 0.12/0.40 cnf(i_0_264, plain, (~equidistant(a,a,a,a)), inference(closure_rule, [i_0_48])).
% 0.12/0.40 cnf(i_0_265, plain, (~equidistant(a,a,a,a)), inference(closure_rule, [i_0_48])).
% 0.12/0.40 cnf(i_0_266, plain, (~equidistant(b,a,b,a)), inference(closure_rule, [i_0_67])).
% 0.12/0.40 cnf(i_0_260, plain, (a=a), inference(etableau_closure_rule, [i_0_260, ...])).
% 0.12/0.40 cnf(i_0_261, plain, (between(b,a,a)), inference(etableau_closure_rule, [i_0_261, ...])).
% 0.12/0.40 cnf(i_0_262, plain, (between(a,a,b)), inference(etableau_closure_rule, [i_0_262, ...])).
% 0.12/0.40 # End printing tableau
% 0.12/0.40 # SZS output end
% 0.12/0.40 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.40 # We now have 6 tableaux to operate on
% 0.12/0.40 # Found closed tableau during pool population.
% 0.12/0.40 # Proof search is over...
% 0.12/0.40 # Freeing feature tree
%------------------------------------------------------------------------------