%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO041-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 : 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:21 EDT 2022 % Result : Unsatisfiable 0.21s 0.48s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GEO041-2 : TPTP v8.1.0. Released v1.0.0. % 0.08/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 12:20:38 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S % 0.14/0.39 # and selection function SelectNewComplexAHPNS. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 21 Number of unprocessed: 21 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.21/0.42 # The folding up rule is enabled... % 0.21/0.42 # Local unification is enabled... % 0.21/0.42 # Any saturation attempts will use folding labels... % 0.21/0.42 # 21 beginning clauses after preprocessing and clausification % 0.21/0.42 # Creating start rules for all 1 conjectures. % 0.21/0.42 # There are 1 start rule candidates: % 0.21/0.42 # Found 9 unit axioms. % 0.21/0.42 # 1 start rule tableaux created. % 0.21/0.42 # 12 extension rule candidate clauses % 0.21/0.42 # 9 unit axiom clauses % 0.21/0.42 % 0.21/0.42 # Requested 8, 32 cores available to the main process. % 0.21/0.42 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.48 # There were 6 total branch saturation attempts. % 0.21/0.48 # There were 0 of these attempts blocked. % 0.21/0.48 # There were 0 deferred branch saturation attempts. % 0.21/0.48 # There were 3 free duplicated saturations. % 0.21/0.48 # There were 6 total successful branch saturations. % 0.21/0.48 # There were 0 successful branch saturations in interreduction. % 0.21/0.48 # There were 0 successful branch saturations on the branch. % 0.21/0.48 # There were 3 successful branch saturations after the branch. % 0.21/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.48 # Begin clausification derivation % 0.21/0.48 % 0.21/0.48 # End clausification derivation % 0.21/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.48 cnf(i_0_40, hypothesis, (between(u,v,w))). % 0.21/0.48 cnf(i_0_41, hypothesis, (between(u,w,v))). % 0.21/0.48 cnf(i_0_22, plain, (equidistant(X1,X2,X2,X1))). % 0.21/0.48 cnf(i_0_25, plain, (between(X1,X2,extension(X1,X2,X3,X4)))). % 0.21/0.48 cnf(i_0_26, plain, (equidistant(X1,extension(X2,X1,X3,X4),X3,X4))). % 0.21/0.48 cnf(i_0_42, negated_conjecture, (w!=v)). % 0.21/0.48 cnf(i_0_31, plain, (~between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3))). % 0.21/0.48 cnf(i_0_32, plain, (~between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1))). % 0.21/0.48 cnf(i_0_33, plain, (~between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2))). % 0.21/0.48 cnf(i_0_28, plain, (X1=X2|~between(X1,X2,X1))). % 0.21/0.48 cnf(i_0_24, plain, (X1=X2|~equidistant(X1,X2,X3,X3))). % 0.21/0.48 cnf(i_0_30, plain, (between(X1,inner_pasch(X2,X3,X4,X1,X5),X2)|~between(X5,X1,X4)|~between(X2,X3,X4))). % 0.21/0.48 cnf(i_0_29, plain, (between(X1,inner_pasch(X2,X1,X3,X4,X5),X5)|~between(X5,X4,X3)|~between(X2,X1,X3))). % 0.21/0.48 cnf(i_0_23, plain, (equidistant(X1,X2,X3,X4)|~equidistant(X5,X6,X3,X4)|~equidistant(X5,X6,X1,X2))). % 0.21/0.48 cnf(i_0_36, plain, (X1=X2|between(X1,X3,euclid2(X1,X4,X2,X3,X5))|~between(X4,X2,X3)|~between(X1,X2,X5))). % 0.21/0.48 cnf(i_0_35, plain, (X1=X2|between(X1,X3,euclid1(X1,X3,X2,X4,X5))|~between(X3,X2,X4)|~between(X1,X2,X5))). % 0.21/0.48 cnf(i_0_37, 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.21/0.48 cnf(i_0_34, 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.21/0.48 cnf(i_0_39, 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.21/0.48 cnf(i_0_38, 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.21/0.48 cnf(i_0_27, 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.21/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.48 # Begin printing tableau % 0.21/0.48 # Found 11 steps % 0.21/0.48 cnf(i_0_42, negated_conjecture, (w!=v), inference(start_rule)). % 0.21/0.48 cnf(i_0_43, plain, (w!=v), inference(extension_rule, [i_0_27])). % 0.21/0.48 cnf(i_0_88, plain, (~between(u,v,w)), inference(closure_rule, [i_0_40])). % 0.21/0.48 cnf(i_0_89, plain, (~between(w,v,extension(w,v,v,w))), inference(closure_rule, [i_0_25])). % 0.21/0.48 cnf(i_0_90, plain, (~equidistant(v,v,v,v)), inference(closure_rule, [i_0_22])). % 0.21/0.48 cnf(i_0_91, plain, (~equidistant(v,extension(w,v,v,w),v,w)), inference(closure_rule, [i_0_26])). % 0.21/0.48 cnf(i_0_87, plain, (equidistant(extension(w,v,v,w),v,w,v)), inference(extension_rule, [i_0_23])). % 0.21/0.48 cnf(i_0_105, plain, (~equidistant(extension(w,v,v,w),v,v,extension(w,v,v,w))), inference(closure_rule, [i_0_22])). % 0.21/0.48 cnf(i_0_92, plain, (~equidistant(w,v,u,v)), inference(etableau_closure_rule, [i_0_92, ...])). % 0.21/0.48 cnf(i_0_93, plain, (~equidistant(w,v,u,v)), inference(etableau_closure_rule, [i_0_93, ...])). % 0.21/0.48 cnf(i_0_104, plain, (equidistant(w,v,v,extension(w,v,v,w))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.21/0.48 # End printing tableau % 0.21/0.48 # SZS output end % 0.21/0.48 # Branches closed with saturation will be marked with an "s" % 0.21/0.48 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.21/0.48 # We now have 8 tableaux to operate on % 0.21/0.48 # Found closed tableau during pool population. % 0.21/0.48 # Proof search is over... % 0.21/0.48 # Freeing feature tree %------------------------------------------------------------------------------