TSTP Solution File: GEO020-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO020-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 : n011.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:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO020-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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 16:08:22 EDT 2022
% 0.13/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: 20 Number of unprocessed: 20
% 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 # 20 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 8 unit axioms.
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 12 extension rule candidate clauses
% 0.19/0.37 # 8 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.41 # There were 25 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 15 free duplicated saturations.
% 0.19/0.41 # There were 25 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 10 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_39, hypothesis, (equidistant(u,v,w,x))).
% 0.19/0.41 cnf(i_0_21, plain, (equidistant(X1,X2,X2,X1))).
% 0.19/0.41 cnf(i_0_25, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.19/0.41 cnf(i_0_24, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.19/0.41 cnf(i_0_40, negated_conjecture, (~equidistant(x,w,u,v))).
% 0.19/0.41 cnf(i_0_30, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.19/0.41 cnf(i_0_31, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.19/0.41 cnf(i_0_32, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.19/0.41 cnf(i_0_23, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.19/0.41 cnf(i_0_27, plain, (X1=X2|~between(X1,X2,X1))).
% 0.19/0.41 cnf(i_0_22, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))).
% 0.19/0.41 cnf(i_0_29, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))).
% 0.19/0.41 cnf(i_0_28, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))).
% 0.19/0.41 cnf(i_0_35, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))).
% 0.19/0.41 cnf(i_0_34, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))).
% 0.19/0.41 cnf(i_0_38, 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.41 cnf(i_0_36, 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.41 cnf(i_0_33, 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.41 cnf(i_0_37, 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.41 cnf(i_0_26, 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.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 15 steps
% 0.19/0.41 cnf(i_0_40, negated_conjecture, (~equidistant(x,w,u,v)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_41, plain, (~equidistant(x,w,u,v)), inference(extension_rule, [i_0_26])).
% 0.19/0.41 cnf(i_0_88, plain, (~equidistant(v,w,w,v)), inference(closure_rule, [i_0_21])).
% 0.19/0.41 cnf(i_0_90, plain, (~equidistant(v,w,w,v)), inference(closure_rule, [i_0_21])).
% 0.19/0.41 cnf(i_0_86, plain, (~between(w,w,u)), inference(extension_rule, [i_0_33])).
% 0.19/0.41 cnf(i_0_176, plain, (~equidistant(w,w,w,w)), inference(closure_rule, [i_0_21])).
% 0.19/0.41 cnf(i_0_178, plain, (~equidistant(w,w,w,w)), inference(closure_rule, [i_0_21])).
% 0.19/0.41 cnf(i_0_84, plain, (v=v), inference(etableau_closure_rule, [i_0_84, ...])).
% 0.19/0.41 cnf(i_0_87, plain, (~between(v,v,x)), inference(etableau_closure_rule, [i_0_87, ...])).
% 0.19/0.41 cnf(i_0_89, plain, (~equidistant(v,x,w,u)), inference(etableau_closure_rule, [i_0_89, ...])).
% 0.19/0.41 cnf(i_0_91, plain, (~equidistant(v,v,w,w)), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.19/0.41 cnf(i_0_172, plain, (w=w), inference(etableau_closure_rule, [i_0_172, ...])).
% 0.19/0.41 cnf(i_0_173, plain, (between(w,u,w)), inference(etableau_closure_rule, [i_0_173, ...])).
% 0.19/0.41 cnf(i_0_174, plain, (between(u,w,w)), inference(etableau_closure_rule, [i_0_174, ...])).
% 0.19/0.41 cnf(i_0_177, plain, (~equidistant(u,w,u,w)), inference(etableau_closure_rule, [i_0_177, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.41 # We now have 4 tableaux to operate on
% 0.19/0.41 # Found closed tableau during pool population.
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------