%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.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 : n025.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:56 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.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 : n025.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 : Sat Jun 18 15:01:58 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 86 Number of unprocessed: 86 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 86 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 5 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 81 extension rule candidate clauses % 0.20/0.38 # 5 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.38 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.20/0.38 # There were 0 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_86, negated_conjecture, (ordered_by(esk25_0,esk26_0,esk26_0))). % 0.20/0.38 cnf(i_0_70, plain, (open(esk17_1(X1)))). % 0.20/0.38 cnf(i_0_34, plain, (inner_point(esk8_1(X1),X1))). % 0.20/0.38 cnf(i_0_76, plain, (start_point(esk20_1(X1),X1))). % 0.20/0.38 cnf(i_0_49, plain, (~between_c(X1,X2,X3,X2))). % 0.20/0.38 cnf(i_0_19, plain, (~inner_point(X1,X2)|~end_point(X1,X2))). % 0.20/0.38 cnf(i_0_29, plain, (~closed(X1)|~end_point(X2,X1))). % 0.20/0.38 cnf(i_0_38, plain, (esk11_2(X1,X2)!=X2|~end_point(X2,X1))). % 0.20/0.38 cnf(i_0_17, plain, (incident_c(X1,X2)|~end_point(X1,X2))). % 0.20/0.38 cnf(i_0_20, plain, (incident_c(X1,X2)|~inner_point(X1,X2))). % 0.20/0.38 cnf(i_0_60, plain, (incident_o(X1,X2)|~start_point(X1,X2))). % 0.20/0.38 cnf(i_0_65, plain, (incident_o(X1,X2)|~finish_point(X1,X2))). % 0.20/0.38 cnf(i_0_30, plain, (open(X1)|~end_point(X2,X1))). % 0.20/0.38 cnf(i_0_66, plain, (incident_o(X1,X2)|~ordered_by(X2,X3,X1))). % 0.20/0.39 cnf(i_0_67, plain, (incident_o(X1,X2)|~ordered_by(X2,X1,X3))). % 0.20/0.39 cnf(i_0_28, plain, (closed(X1)|end_point(esk6_1(X1),X1))). % 0.20/0.39 cnf(i_0_31, plain, (end_point(esk7_1(X1),X1)|~open(X1))). % 0.20/0.39 cnf(i_0_26, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))). % 0.20/0.39 cnf(i_0_27, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))). % 0.20/0.39 cnf(i_0_1, plain, (part_of(X1,X2)|~incident_c(esk1_2(X2,X1),X2))). % 0.20/0.39 cnf(i_0_58, plain, (start_point(X1,X2)|esk15_2(X1,X2)!=X1|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_32, plain, (X1=X2|open(X1)|~part_of(X1,X2))). % 0.20/0.39 cnf(i_0_68, plain, (incident_o(X1,X2)|~incident_c(X1,esk17_1(X2)))). % 0.20/0.39 cnf(i_0_63, plain, (finish_point(X1,X2)|esk16_2(X1,X2)!=X1|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_69, plain, (incident_c(X1,esk17_1(X2))|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_39, plain, (end_point(esk11_2(X1,X2),X1)|~end_point(X2,X1))). % 0.20/0.39 cnf(i_0_2, plain, (incident_c(esk1_2(X1,X2),X2)|part_of(X2,X1))). % 0.20/0.39 cnf(i_0_85, plain, (incident_c(X1,underlying_curve(X2))|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_18, plain, (inner_point(X1,X2)|end_point(X1,X2)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_3, plain, (incident_c(X1,X2)|~incident_c(X1,X3)|~part_of(X3,X2))). % 0.20/0.39 cnf(i_0_56, plain, (start_point(X1,X2)|~ordered_by(X2,X1,esk15_2(X1,X2)))). % 0.20/0.39 cnf(i_0_41, plain, (esk12_2(X1,X2)=sum(X1,X2)|~meet(X3,X1,X2))). % 0.20/0.39 cnf(i_0_61, plain, (finish_point(X1,X2)|~ordered_by(X2,esk16_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_84, plain, (incident_o(X1,X2)|~incident_c(X1,underlying_curve(X2)))). % 0.20/0.39 cnf(i_0_55, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X4,X3)|~between_o(X1,X4,X3,X2))). % 0.20/0.39 cnf(i_0_7, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X3))). % 0.20/0.39 cnf(i_0_11, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk3_2(X1,X2),esk4_2(X1,X2)))). % 0.20/0.39 cnf(i_0_10, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk4_2(X1,X2),esk3_2(X1,X2)))). % 0.20/0.39 cnf(i_0_43, plain, (X1=X2|~incident_c(esk13_2(X1,X2),X2)|~incident_c(esk13_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_83, plain, (X1=underlying_curve(X2)|~incident_o(esk24_2(X1,X2),X2)|~incident_c(esk24_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_13, plain, (end_point(X1,X2)|incident_c(X1,esk3_2(X1,X2))|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_53, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)|~between_o(X1,X4,X3,X2))). % 0.20/0.39 cnf(i_0_54, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)|~between_o(X1,X3,X2,X4))). % 0.20/0.39 cnf(i_0_52, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X2,X4)|~between_o(X1,X3,X2,X4))). % 0.20/0.39 cnf(i_0_8, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_12, plain, (end_point(X1,X2)|incident_c(X1,esk4_2(X1,X2))|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_50, plain, (between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X2)|~ordered_by(X1,X4,X3))). % 0.20/0.39 cnf(i_0_51, plain, (between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X4)|~ordered_by(X1,X2,X3))). % 0.20/0.39 cnf(i_0_24, plain, (end_point(X1,X2)|~meet(X3,X4,X2)|~incident_c(X1,X4)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_25, plain, (end_point(X1,X2)|~meet(X3,X2,X4)|~incident_c(X1,X4)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_15, plain, (end_point(X1,X2)|part_of(esk3_2(X1,X2),X2)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_64, plain, (X1=X2|ordered_by(X3,X2,X1)|~finish_point(X1,X3)|~incident_o(X2,X3))). % 0.20/0.39 cnf(i_0_59, plain, (X1=X2|ordered_by(X3,X1,X2)|~incident_o(X2,X3)|~start_point(X1,X3))). % 0.20/0.39 cnf(i_0_14, plain, (end_point(X1,X2)|part_of(esk4_2(X1,X2),X2)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_57, plain, (incident_o(esk15_2(X1,X2),X2)|start_point(X1,X2)|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_37, plain, (X1=X2|X1=X3|X2=X3|~end_point(X3,X4)|~end_point(X2,X4)|~end_point(X1,X4))). % 0.20/0.39 cnf(i_0_62, plain, (finish_point(X1,X2)|incident_o(esk16_2(X1,X2),X2)|~incident_o(X1,X2))). % 0.20/0.39 cnf(i_0_74, plain, (incident_o(X1,X2)|~between_o(X2,X3,X4,X5)|~incident_c(X1,esk18_4(X3,X4,X5,X2)))). % 0.20/0.39 cnf(i_0_46, plain, (end_point(X1,esk14_4(X2,X3,X4,X1))|~between_c(X2,X3,X4,X1))). % 0.20/0.39 cnf(i_0_47, plain, (end_point(X1,esk14_4(X2,X1,X3,X4))|~between_c(X2,X1,X3,X4))). % 0.20/0.39 cnf(i_0_45, plain, (inner_point(X1,esk14_4(X2,X3,X1,X4))|~between_c(X2,X3,X1,X4))). % 0.20/0.39 cnf(i_0_35, plain, (sum(esk9_2(X1,X2),esk10_2(X1,X2))=X1|~inner_point(X2,X1))). % 0.20/0.39 cnf(i_0_48, plain, (part_of(esk14_4(X1,X2,X3,X4),X1)|~between_c(X1,X2,X3,X4))). % 0.20/0.39 cnf(i_0_36, plain, (meet(X1,esk9_2(X2,X1),esk10_2(X2,X1))|~inner_point(X1,X2))). % 0.20/0.39 cnf(i_0_82, plain, (X1=underlying_curve(X2)|incident_o(esk24_2(X1,X2),X2)|incident_c(esk24_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_5, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X3)|~incident_c(esk2_3(X1,X2,X3),X1))). % 0.20/0.39 cnf(i_0_9, plain, (incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2)))). % 0.20/0.39 cnf(i_0_6, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X2)|~incident_c(esk2_3(X1,X2,X3),X1))). % 0.20/0.39 cnf(i_0_79, plain, (X1=X2|incident_c(X3,X4)|~incident_o(X3,esk21_3(X1,X2,X4))|~open(X4)|~incident_c(X2,X4)|~incident_c(X1,X4))). % 0.20/0.39 cnf(i_0_81, plain, (X1=X2|~ordered_by(X2,esk22_2(X1,X2),esk23_2(X1,X2))|~ordered_by(X1,esk22_2(X1,X2),esk23_2(X1,X2)))). % 0.20/0.39 cnf(i_0_75, plain, (incident_c(X1,esk18_4(X2,X3,X4,X5))|~incident_o(X1,X5)|~between_o(X5,X2,X3,X4))). % 0.20/0.39 cnf(i_0_42, plain, (X1=X2|incident_c(esk13_2(X1,X2),X1)|incident_c(esk13_2(X1,X2),X2))). % 0.20/0.39 cnf(i_0_77, plain, (X1=X2|ordered_by(esk21_3(X1,X2,X3),X1,X2)|~open(X3)|~incident_c(X2,X3)|~incident_c(X1,X3))). % 0.20/0.39 cnf(i_0_73, plain, (between_c(esk18_4(X1,X2,X3,X4),X1,X2,X3)|~between_o(X4,X1,X2,X3))). % 0.20/0.39 cnf(i_0_22, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_23, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_16, plain, (part_of(X1,X2)|part_of(X2,X1)|~end_point(X3,X4)|~incident_c(X3,X2)|~incident_c(X3,X1)|~part_of(X2,X4)|~part_of(X1,X4))). % 0.20/0.39 cnf(i_0_78, plain, (X1=X2|incident_o(X3,esk21_3(X1,X2,X4))|~open(X4)|~incident_c(X2,X4)|~incident_c(X1,X4)|~incident_c(X3,X4))). % 0.20/0.39 cnf(i_0_40, plain, (meet(X1,X2,X3)|~closed(sum(X2,X3))|~meet(X4,X2,X3)|~end_point(X1,X2))). % 0.20/0.39 cnf(i_0_21, plain, (meet(X1,X2,X3)|~end_point(esk5_3(X1,X2,X3),X3)|~end_point(esk5_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.20/0.39 cnf(i_0_72, plain, (between_o(X1,X2,X3,X4)|~incident_o(esk19_5(X2,X3,X4,X1,X5),X1)|~between_c(X5,X2,X3,X4)|~incident_c(esk19_5(X2,X3,X4,X1,X5),X5))). % 0.20/0.39 cnf(i_0_80, plain, (X1=X2|ordered_by(X1,esk22_2(X1,X2),esk23_2(X1,X2))|ordered_by(X2,esk22_2(X1,X2),esk23_2(X1,X2)))). % 0.20/0.39 cnf(i_0_44, plain, (X1=X2|between_c(X3,X1,X4,X2)|~inner_point(X4,X5)|~end_point(X2,X5)|~end_point(X1,X5)|~part_of(X5,X3))). % 0.20/0.39 cnf(i_0_71, plain, (incident_o(esk19_5(X1,X2,X3,X4,X5),X4)|between_o(X4,X1,X2,X3)|incident_c(esk19_5(X1,X2,X3,X4,X5),X5)|~between_c(X5,X1,X2,X3))). % 0.20/0.39 cnf(i_0_4, plain, (X1=sum(X2,X3)|incident_c(esk2_3(X1,X2,X3),X1)|incident_c(esk2_3(X1,X2,X3),X2)|incident_c(esk2_3(X1,X2,X3),X3))). % 0.20/0.39 cnf(i_0_33, plain, (part_of(X1,X2)|part_of(X1,X3)|part_of(X2,X1)|part_of(X2,X3)|part_of(X3,X1)|part_of(X3,X2)|~end_point(X4,X3)|~end_point(X4,X2)|~end_point(X4,X1)|~part_of(X3,X5)|~part_of(X2,X5)|~part_of(X1,X5))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_86, negated_conjecture, (ordered_by(esk25_0,esk26_0,esk26_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_94, plain, (ordered_by(esk25_0,esk26_0,esk26_0)), inference(extension_rule, [i_0_51])). % 0.20/0.39 cnf(i_0_196, plain, (~ordered_by(esk25_0,esk26_0,esk26_0)), inference(closure_rule, [i_0_86])). % 0.20/0.39 cnf(i_0_195, plain, (between_o(esk25_0,esk26_0,esk26_0,esk26_0)), inference(extension_rule, [i_0_73])). % 0.20/0.39 cnf(i_0_528, plain, (between_c(esk18_4(esk26_0,esk26_0,esk26_0,esk25_0),esk26_0,esk26_0,esk26_0)), inference(closure_rule, [i_0_49])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 8 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------