TSTP Solution File: GEO048-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO048-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 : 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:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO048-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 18:19:58 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___211_C18_F1_AE_CS_SP_S0Y
% 0.14/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.38 #
% 0.14/0.38 # Number of axioms: 23 Number of unprocessed: 23
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 23 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 2 conjectures.
% 0.14/0.38 # There are 2 start rule candidates:
% 0.14/0.38 # Found 11 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 2 start rule tableaux created.
% 0.14/0.38 # 12 extension rule candidate clauses
% 0.14/0.38 # 11 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.20/0.42 # There were 18 total branch saturation attempts.
% 0.20/0.42 # There were 0 of these attempts blocked.
% 0.20/0.42 # There were 0 deferred branch saturation attempts.
% 0.20/0.42 # There were 6 free duplicated saturations.
% 0.20/0.42 # There were 18 total successful branch saturations.
% 0.20/0.42 # There were 0 successful branch saturations in interreduction.
% 0.20/0.42 # There were 0 successful branch saturations on the branch.
% 0.20/0.42 # There were 12 successful branch saturations after the branch.
% 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 # Begin clausification derivation
% 0.20/0.42
% 0.20/0.42 # End clausification derivation
% 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.42 cnf(i_0_42, hypothesis, (between(u,v,w))).
% 0.20/0.42 cnf(i_0_44, hypothesis, (between(u,x,u1))).
% 0.20/0.42 cnf(i_0_43, hypothesis, (between(u1,v1,w))).
% 0.20/0.42 cnf(i_0_33, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))).
% 0.20/0.42 cnf(i_0_34, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))).
% 0.20/0.42 cnf(i_0_35, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))).
% 0.20/0.42 cnf(i_0_30, plain, (X1=X2|~between(X1,X2,X1))).
% 0.20/0.42 cnf(i_0_24, plain, (equidistant(X1,X2,X2,X1))).
% 0.20/0.42 cnf(i_0_26, plain, (X1=X2|~equidistant(X1,X2,X3,X3))).
% 0.20/0.42 cnf(i_0_27, plain, (between(X1,X2,extension(X1,X2,X3,X4)))).
% 0.20/0.42 cnf(i_0_28, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))).
% 0.20/0.42 cnf(i_0_25, plain, (equidistant(X3,X4,X5,X6)|~equidistant(X1,X2,X5,X6)|~equidistant(X1,X2,X3,X4))).
% 0.20/0.42 cnf(i_0_36, 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.20/0.42 cnf(i_0_29, 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.20/0.42 cnf(i_0_32, plain, (between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)|~between(X4,X5,X3)|~between(X1,X2,X3))).
% 0.20/0.42 cnf(i_0_31, plain, (between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)|~between(X4,X5,X3)|~between(X1,X2,X3))).
% 0.20/0.42 cnf(i_0_38, plain, (X1=X2|between(X1,X5,euclid2(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.20/0.42 cnf(i_0_37, plain, (X1=X2|between(X1,X4,euclid1(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.20/0.42 cnf(i_0_39, plain, (X1=X2|between(euclid1(X1,X4,X2,X5,X3),X3,euclid2(X1,X4,X2,X5,X3))|~between(X4,X2,X5)|~between(X1,X2,X3))).
% 0.20/0.42 cnf(i_0_46, negated_conjecture, (~between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1))).
% 0.20/0.42 cnf(i_0_45, negated_conjecture, (~between(x,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),w))).
% 0.20/0.42 cnf(i_0_40, plain, (between(X3,continuous(X1,X2,X3,X6,X4,X5),X5)|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))).
% 0.20/0.42 cnf(i_0_41, plain, (equidistant(X1,X6,X1,continuous(X1,X2,X3,X6,X4,X5))|~between(X2,X6,X4)|~between(X1,X2,X4)|~equidistant(X1,X4,X1,X5)|~equidistant(X1,X2,X1,X3))).
% 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.42 # Begin printing tableau
% 0.20/0.42 # Found 10 steps
% 0.20/0.42 cnf(i_0_46, negated_conjecture, (~between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1)), inference(start_rule)).
% 0.20/0.42 cnf(i_0_48, plain, (~between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1)), inference(extension_rule, [i_0_32])).
% 0.20/0.42 cnf(i_0_122, plain, (~between(w,v,u)), inference(extension_rule, [i_0_36])).
% 0.20/0.42 cnf(i_0_160, plain, (~equidistant(u,u,u,u)), inference(closure_rule, [i_0_24])).
% 0.20/0.42 cnf(i_0_123, plain, (~between(v1,inner_pasch(u,x,u1,v1,w),u)), inference(etableau_closure_rule, [i_0_123, ...])).
% 0.20/0.42 cnf(i_0_156, plain, (u=u), inference(etableau_closure_rule, [i_0_156, ...])).
% 0.20/0.42 cnf(i_0_157, plain, (between(u,w,v)), inference(etableau_closure_rule, [i_0_157, ...])).
% 0.20/0.42 cnf(i_0_158, plain, (between(v,u,w)), inference(etableau_closure_rule, [i_0_158, ...])).
% 0.20/0.42 cnf(i_0_161, plain, (~equidistant(v,u,v,u)), inference(etableau_closure_rule, [i_0_161, ...])).
% 0.20/0.42 cnf(i_0_162, plain, (~equidistant(w,u,w,u)), inference(etableau_closure_rule, [i_0_162, ...])).
% 0.20/0.42 # End printing tableau
% 0.20/0.42 # SZS output end
% 0.20/0.42 # Branches closed with saturation will be marked with an "s"
% 0.20/0.42 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.42 # We now have 9 tableaux to operate on
% 0.20/0.42 # Found closed tableau during pool population.
% 0.20/0.42 # Proof search is over...
% 0.20/0.42 # Freeing feature tree
%------------------------------------------------------------------------------