TSTP Solution File: GEO037-2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GEO037-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 : n008.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:18 EDT 2022

% Result   : Unsatisfiable 0.19s 0.44s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO037-2 : TPTP v8.1.0. Released v1.0.0.
% 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.33  % Computer : n008.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jun 17 20:56:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.37  # No SInE strategy applied
% 0.19/0.37  # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.19/0.37  # and selection function SelectNewComplexAHPNS.
% 0.19/0.37  #
% 0.19/0.37  # Presaturation interreduction done
% 0.19/0.37  # Number of axioms: 19 Number of unprocessed: 19
% 0.19/0.37  # Tableaux proof search.
% 0.19/0.37  # APR header successfully linked.
% 0.19/0.37  # Hello from C++
% 0.19/0.37  # The folding up rule is enabled...
% 0.19/0.37  # Local unification is enabled...
% 0.19/0.37  # Any saturation attempts will use folding labels...
% 0.19/0.37  # 19 beginning clauses after preprocessing and clausification
% 0.19/0.37  # Creating start rules for all 1 conjectures.
% 0.19/0.37  # There are 1 start rule candidates:
% 0.19/0.37  # Found 6 unit axioms.
% 0.19/0.37  # 1 start rule tableaux created.
% 0.19/0.37  # 13 extension rule candidate clauses
% 0.19/0.37  # 6 unit axiom clauses
% 0.19/0.37  
% 0.19/0.37  # Requested 8, 32 cores available to the main process.
% 0.19/0.37  # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.44  # There were 28 total branch saturation attempts.
% 0.19/0.44  # There were 0 of these attempts blocked.
% 0.19/0.44  # There were 0 deferred branch saturation attempts.
% 0.19/0.44  # There were 17 free duplicated saturations.
% 0.19/0.44  # There were 28 total successful branch saturations.
% 0.19/0.44  # There were 0 successful branch saturations in interreduction.
% 0.19/0.44  # There were 0 successful branch saturations on the branch.
% 0.19/0.44  # There were 11 successful branch saturations after the branch.
% 0.19/0.44  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44  # Begin clausification derivation
% 0.19/0.44  
% 0.19/0.44  # End clausification derivation
% 0.19/0.44  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.44  cnf(i_0_20, plain, (equidistant(X1,X2,X2,X1))).
% 0.19/0.44  cnf(i_0_23, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.19/0.44  cnf(i_0_24, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.19/0.44  cnf(i_0_29, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.19/0.44  cnf(i_0_30, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.19/0.44  cnf(i_0_31, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.19/0.44  cnf(i_0_26, plain, (X1=X2|~between(X1,X2,X1))).
% 0.19/0.44  cnf(i_0_22, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.19/0.44  cnf(i_0_21, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 0.19/0.44  cnf(i_0_28, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 0.19/0.44  cnf(i_0_27, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 0.19/0.44  cnf(i_0_34, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))).
% 0.19/0.44  cnf(i_0_33, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 0.19/0.44  cnf(i_0_38, negated_conjecture, (extension(u,v,lower_dimension_point_1,lower_dimension_point_2)=v|~equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)))).
% 0.19/0.44  cnf(i_0_35, 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.19/0.44  cnf(i_0_37, 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.19/0.44  cnf(i_0_36, 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.19/0.44  cnf(i_0_32, 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.19/0.44  cnf(i_0_25, 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.19/0.44  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.44  # Begin printing tableau
% 0.19/0.44  # Found 16 steps
% 0.19/0.44  cnf(i_0_38, negated_conjecture, (extension(u,v,lower_dimension_point_1,lower_dimension_point_2)=v|~equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))), inference(start_rule)).
% 0.19/0.44  cnf(i_0_40, plain, (~equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))), inference(extension_rule, [i_0_25])).
% 0.19/0.44  cnf(i_0_139, plain, (~equidistant(extension(w,x,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(w,x,lower_dimension_point_1,lower_dimension_point_2))), inference(closure_rule, [i_0_20])).
% 0.19/0.44  cnf(i_0_141, plain, (~equidistant(extension(w,x,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(w,x,lower_dimension_point_1,lower_dimension_point_2))), inference(closure_rule, [i_0_20])).
% 0.19/0.44  cnf(i_0_137, plain, (~between(extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x)), inference(extension_rule, [i_0_32])).
% 0.19/0.44  cnf(i_0_236, plain, (~equidistant(extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(closure_rule, [i_0_20])).
% 0.19/0.44  cnf(i_0_238, plain, (~equidistant(extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(closure_rule, [i_0_20])).
% 0.19/0.44  cnf(i_0_39, plain, (extension(u,v,lower_dimension_point_1,lower_dimension_point_2)=v), inference(etableau_closure_rule, [i_0_39, ...])).
% 0.19/0.44  cnf(i_0_135, plain, (extension(w,x,lower_dimension_point_1,lower_dimension_point_2)=extension(w,x,lower_dimension_point_1,lower_dimension_point_2)), inference(etableau_closure_rule, [i_0_135, ...])).
% 0.19/0.44  cnf(i_0_138, plain, (~between(extension(w,x,lower_dimension_point_1,lower_dimension_point_2),extension(w,x,lower_dimension_point_1,lower_dimension_point_2),v)), inference(etableau_closure_rule, [i_0_138, ...])).
% 0.19/0.44  cnf(i_0_140, plain, (~equidistant(extension(w,x,lower_dimension_point_1,lower_dimension_point_2),v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x)), inference(etableau_closure_rule, [i_0_140, ...])).
% 0.19/0.44  cnf(i_0_142, plain, (~equidistant(extension(w,x,lower_dimension_point_1,lower_dimension_point_2),extension(w,x,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(etableau_closure_rule, [i_0_142, ...])).
% 0.19/0.44  cnf(i_0_232, plain, (extension(u,v,lower_dimension_point_1,lower_dimension_point_2)=extension(u,v,lower_dimension_point_1,lower_dimension_point_2)), inference(etableau_closure_rule, [i_0_232, ...])).
% 0.19/0.44  cnf(i_0_233, plain, (between(extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(etableau_closure_rule, [i_0_233, ...])).
% 0.19/0.44  cnf(i_0_234, plain, (between(x,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(etableau_closure_rule, [i_0_234, ...])).
% 0.19/0.44  cnf(i_0_237, plain, (~equidistant(x,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(u,v,lower_dimension_point_1,lower_dimension_point_2))), inference(etableau_closure_rule, [i_0_237, ...])).
% 0.19/0.44  # End printing tableau
% 0.19/0.44  # SZS output end
% 0.19/0.44  # Branches closed with saturation will be marked with an "s"
% 0.19/0.44  # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.44  # We now have 4 tableaux to operate on
% 0.19/0.44  # Found closed tableau during pool population.
% 0.19/0.44  # Proof search is over...
% 0.19/0.44  # Freeing feature tree
%------------------------------------------------------------------------------