TSTP Solution File: GEO007-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO007-1 : TPTP v8.1.0. Bugfixed v2.5.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 : n010.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:03 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO007-1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.07/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 : n010.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 02:05:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.39 # No SInE strategy applied
% 0.20/0.39 # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.20/0.39 # and selection function SelectNewComplexAHPNS.
% 0.20/0.39 #
% 0.20/0.39 # Presaturation interreduction done
% 0.20/0.39 # Number of axioms: 25 Number of unprocessed: 25
% 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 # 25 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 11 unit axioms.
% 0.20/0.39 # 1 start rule tableaux created.
% 0.20/0.39 # 14 extension rule candidate clauses
% 0.20/0.39 # 11 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.46 # There were 9 total branch saturation attempts.
% 0.20/0.46 # There were 0 of these attempts blocked.
% 0.20/0.46 # There were 0 deferred branch saturation attempts.
% 0.20/0.46 # There were 4 free duplicated saturations.
% 0.20/0.46 # There were 9 total successful branch saturations.
% 0.20/0.46 # There were 0 successful branch saturations in interreduction.
% 0.20/0.46 # There were 0 successful branch saturations on the branch.
% 0.20/0.46 # There were 5 successful branch saturations after the branch.
% 0.20/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Begin clausification derivation
% 0.20/0.46
% 0.20/0.46 # End clausification derivation
% 0.20/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.46 cnf(i_0_47, hypothesis, (between(d,a,c))).
% 0.20/0.46 cnf(i_0_48, hypothesis, (between(e,a,c))).
% 0.20/0.46 cnf(i_0_29, plain, (equidistant(X1,X2,X2,X1))).
% 0.20/0.46 cnf(i_0_38, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.20/0.46 cnf(i_0_39, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.20/0.46 cnf(i_0_46, hypothesis, (c!=a)).
% 0.20/0.46 cnf(i_0_49, hypothesis, (~between(d,e,a))).
% 0.20/0.46 cnf(i_0_50, negated_conjecture, (~between(e,d,a))).
% 0.20/0.46 cnf(i_0_40, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.20/0.46 cnf(i_0_41, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.20/0.46 cnf(i_0_42, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.20/0.46 cnf(i_0_26, plain, (X1=X2|~between(X1,X2,X1))).
% 0.20/0.46 cnf(i_0_30, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.20/0.46 cnf(i_0_27, plain, (between(X1,X2,X3)|~between(X2,X3,X4)|~between(X1,X2,X4))).
% 0.20/0.46 cnf(i_0_33, plain, (between(X1,X2,outer_pasch(X2,X3,X4,X1,X5))|~between(X4,X5,X1)|~between(X3,X2,X5))).
% 0.20/0.46 cnf(i_0_32, plain, (between(X1,outer_pasch(X2,X1,X3,X4,X5),X3)|~between(X3,X5,X4)|~between(X1,X2,X5))).
% 0.20/0.46 cnf(i_0_31, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 0.20/0.46 cnf(i_0_28, plain, (X1=X2|between(X1,X3,X4)|between(X1,X4,X3)|~between(X1,X2,X4)|~between(X1,X2,X3))).
% 0.20/0.46 cnf(i_0_34, plain, (X1=X2|between(X1,X3,euclid1(X4,X1,X5,X3,X2))|~between(X5,X2,X3)|~between(X1,X2,X4))).
% 0.20/0.46 cnf(i_0_35, plain, (X1=X2|between(X1,X3,euclid2(X4,X1,X3,X5,X2))|~between(X3,X2,X5)|~between(X1,X2,X4))).
% 0.20/0.46 cnf(i_0_36, plain, (X1=X2|between(euclid1(X3,X1,X4,X5,X2),X3,euclid2(X3,X1,X4,X5,X2))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.20/0.46 cnf(i_0_44, plain, (equidistant(X1,X2,X1,continuous(X3,X2,X4,X5,X6,X1))|~equidistant(X1,X4,X1,X6)|~equidistant(X1,X3,X1,X5)|~between(X3,X2,X4)|~between(X1,X3,X4))).
% 0.20/0.46 cnf(i_0_45, plain, (between(X1,continuous(X2,X3,X4,X1,X5,X6),X5)|~equidistant(X6,X4,X6,X5)|~equidistant(X6,X2,X6,X1)|~between(X2,X3,X4)|~between(X6,X2,X4))).
% 0.20/0.46 cnf(i_0_43, 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.46 cnf(i_0_37, plain, (X1=X2|equidistant(X3,X4,X5,X6)|~equidistant(X2,X4,X7,X6)|~equidistant(X2,X3,X7,X5)|~equidistant(X1,X4,X8,X6)|~equidistant(X1,X2,X8,X7)|~between(X8,X7,X5)|~between(X1,X2,X3))).
% 0.20/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.46 # Begin printing tableau
% 0.20/0.46 # Found 10 steps
% 0.20/0.46 cnf(i_0_50, negated_conjecture, (~between(e,d,a)), inference(start_rule)).
% 0.20/0.46 cnf(i_0_51, plain, (~between(e,d,a)), inference(extension_rule, [i_0_43])).
% 0.20/0.46 cnf(i_0_95, plain, (c=a), inference(closure_rule, [i_0_46])).
% 0.20/0.46 cnf(i_0_96, plain, (between(d,a,e)), inference(extension_rule, [i_0_27])).
% 0.20/0.46 cnf(i_0_114, plain, (between(e,d,a)), inference(closure_rule, [i_0_50])).
% 0.20/0.46 cnf(i_0_97, plain, (between(a,e,d)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.20/0.46 cnf(i_0_99, plain, (~equidistant(e,c,e,a)), inference(etableau_closure_rule, [i_0_99, ...])).
% 0.20/0.46 cnf(i_0_100, plain, (~equidistant(a,c,a,a)), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.20/0.46 cnf(i_0_101, plain, (~equidistant(d,c,d,a)), inference(etableau_closure_rule, [i_0_101, ...])).
% 0.20/0.46 cnf(i_0_116, plain, (~between(e,d,e)), inference(etableau_closure_rule, [i_0_116, ...])).
% 0.20/0.46 # End printing tableau
% 0.20/0.46 # SZS output end
% 0.20/0.46 # Branches closed with saturation will be marked with an "s"
% 0.20/0.46 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.46 # We now have 7 tableaux to operate on
% 0.20/0.46 # Found closed tableau during pool population.
% 0.20/0.46 # Proof search is over...
% 0.20/0.46 # Freeing feature tree
%------------------------------------------------------------------------------