TSTP Solution File: GEO008-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO008-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 : n015.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.55s 0.76s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO008-1 : TPTP v8.1.0. Bugfixed v2.5.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 : n015.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 : Fri Jun 17 20:37:27 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___211_C18_F1_AE_CS_SP_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 24 Number of unprocessed: 24
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.48/0.66 # The folding up rule is enabled...
% 0.48/0.66 # Local unification is enabled...
% 0.48/0.66 # Any saturation attempts will use folding labels...
% 0.48/0.66 # 24 beginning clauses after preprocessing and clausification
% 0.48/0.66 # Creating start rules for all 1 conjectures.
% 0.48/0.66 # There are 1 start rule candidates:
% 0.48/0.66 # Found 10 unit axioms.
% 0.48/0.66 # 1 start rule tableaux created.
% 0.48/0.66 # 14 extension rule candidate clauses
% 0.48/0.66 # 10 unit axiom clauses
% 0.48/0.66
% 0.48/0.66 # Requested 8, 32 cores available to the main process.
% 0.48/0.66 # There are not enough tableaux to fork, creating more from the initial 1
% 0.55/0.76 # There were 36 total branch saturation attempts.
% 0.55/0.76 # There were 0 of these attempts blocked.
% 0.55/0.76 # There were 0 deferred branch saturation attempts.
% 0.55/0.76 # There were 22 free duplicated saturations.
% 0.55/0.76 # There were 36 total successful branch saturations.
% 0.55/0.76 # There were 0 successful branch saturations in interreduction.
% 0.55/0.76 # There were 0 successful branch saturations on the branch.
% 0.55/0.76 # There were 14 successful branch saturations after the branch.
% 0.55/0.76 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.76 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.76 # Begin clausification derivation
% 0.55/0.76
% 0.55/0.76 # End clausification derivation
% 0.55/0.76 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.55/0.76 cnf(i_0_45, hypothesis, (between(a,c,e))).
% 0.55/0.76 cnf(i_0_46, hypothesis, (between(a,d,e))).
% 0.55/0.76 cnf(i_0_47, hypothesis, (between(c,b,d))).
% 0.55/0.76 cnf(i_0_39, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.55/0.76 cnf(i_0_40, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.55/0.76 cnf(i_0_41, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.55/0.76 cnf(i_0_48, negated_conjecture, (~between(a,b,e))).
% 0.55/0.76 cnf(i_0_25, plain, (X1=X2|~between(X1,X2,X1))).
% 0.55/0.76 cnf(i_0_26, plain, (between(X1,X2,X4)|~between(X2,X4,X3)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_28, plain, (equidistant(X1,X2,X2,X1))).
% 0.55/0.76 cnf(i_0_27, plain, (X1=X2|between(X1,X4,X3)|between(X1,X3,X4)|~between(X1,X2,X4)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_29, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.55/0.76 cnf(i_0_37, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.55/0.76 cnf(i_0_38, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.55/0.76 cnf(i_0_30, plain, (equidistant(X3,X4,X5,X6)|~equidistant(X1,X2,X5,X6)|~equidistant(X1,X2,X3,X4))).
% 0.55/0.76 cnf(i_0_42, plain, (X2=X3|between(X5,X1,X4)|between(X4,X5,X1)|between(X1,X4,X5)|~equidistant(X5,X2,X5,X3)|~equidistant(X4,X2,X4,X3)|~equidistant(X1,X2,X1,X3))).
% 0.55/0.76 cnf(i_0_36, plain, (X1=X2|equidistant(X5,X7,X6,X8)|~between(X3,X4,X6)|~between(X1,X2,X5)|~equidistant(X2,X7,X4,X8)|~equidistant(X2,X5,X4,X6)|~equidistant(X1,X7,X3,X8)|~equidistant(X1,X2,X3,X4))).
% 0.55/0.76 cnf(i_0_32, plain, (between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))|~between(X4,X3,X5)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_31, plain, (between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)|~between(X4,X3,X5)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_33, plain, (X1=X2|between(X1,X5,euclid1(X3,X1,X4,X5,X2))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_34, plain, (X1=X2|between(X1,X4,euclid2(X3,X1,X4,X5,X2))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.55/0.76 cnf(i_0_35, 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.55/0.76 cnf(i_0_44, plain, (between(X3,continuous(X2,X6,X4,X3,X5,X1),X5)|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))).
% 0.55/0.76 cnf(i_0_43, plain, (equidistant(X1,X6,X1,continuous(X2,X6,X4,X3,X5,X1))|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))).
% 0.55/0.76 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.55/0.76 # Begin printing tableau
% 0.55/0.76 # Found 15 steps
% 0.55/0.76 cnf(i_0_48, negated_conjecture, (~between(a,b,e)), inference(start_rule)).
% 0.55/0.76 cnf(i_0_49, plain, (~between(a,b,e)), inference(extension_rule, [i_0_42])).
% 0.55/0.76 cnf(i_0_69, plain, (~equidistant(e,e,e,e)), inference(closure_rule, [i_0_28])).
% 0.55/0.76 cnf(i_0_66, plain, (between(e,a,b)), inference(extension_rule, [i_0_36])).
% 0.55/0.76 cnf(i_0_13874, plain, (~between(a,c,e)), inference(closure_rule, [i_0_45])).
% 0.55/0.76 cnf(i_0_13876, plain, (~equidistant(a,c,c,a)), inference(closure_rule, [i_0_28])).
% 0.55/0.76 cnf(i_0_65, plain, (e=e), inference(etableau_closure_rule, [i_0_65, ...])).
% 0.55/0.76 cnf(i_0_67, plain, (between(b,e,a)), inference(etableau_closure_rule, [i_0_67, ...])).
% 0.55/0.76 cnf(i_0_70, plain, (~equidistant(b,e,b,e)), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.55/0.76 cnf(i_0_71, plain, (~equidistant(a,e,a,e)), inference(etableau_closure_rule, [i_0_71, ...])).
% 0.55/0.76 cnf(i_0_13872, plain, (e=a), inference(etableau_closure_rule, [i_0_13872, ...])).
% 0.55/0.76 cnf(i_0_13873, plain, (equidistant(b,c,e,a)), inference(etableau_closure_rule, [i_0_13873, ...])).
% 0.55/0.76 cnf(i_0_13877, plain, (~equidistant(a,b,c,e)), inference(etableau_closure_rule, [i_0_13877, ...])).
% 0.55/0.76 cnf(i_0_13878, plain, (~equidistant(e,c,a,a)), inference(etableau_closure_rule, [i_0_13878, ...])).
% 0.55/0.76 cnf(i_0_13879, plain, (~equidistant(e,a,a,c)), inference(etableau_closure_rule, [i_0_13879, ...])).
% 0.55/0.76 # End printing tableau
% 0.55/0.76 # SZS output end
% 0.55/0.76 # Branches closed with saturation will be marked with an "s"
% 0.55/0.76 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.55/0.76 # We now have 11 tableaux to operate on
% 0.55/0.76 # Found closed tableau during pool population.
% 0.55/0.76 # Proof search is over...
% 0.55/0.76 # Freeing feature tree
%------------------------------------------------------------------------------