TSTP Solution File: GEO124-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO124-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 : 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:59 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 02:10:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 88 Number of unprocessed: 88
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 88 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 3 conjectures.
% 0.20/0.37 # There are 3 start rule candidates:
% 0.20/0.37 # Found 7 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 3 start rule tableaux created.
% 0.20/0.37 # 81 extension rule candidate clauses
% 0.20/0.37 # 7 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 16 tableaux to operate on
% 0.20/0.41 # There were 2 total branch saturation attempts.
% 0.20/0.41 # There were 0 of these attempts blocked.
% 0.20/0.41 # There were 0 deferred branch saturation attempts.
% 0.20/0.41 # There were 0 free duplicated saturations.
% 0.20/0.41 # There were 2 total successful branch saturations.
% 0.20/0.41 # There were 0 successful branch saturations in interreduction.
% 0.20/0.41 # There were 0 successful branch saturations on the branch.
% 0.20/0.41 # There were 2 successful branch saturations after the branch.
% 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # Begin clausification derivation
% 0.20/0.41
% 0.20/0.41 # End clausification derivation
% 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.41 cnf(i_0_196, negated_conjecture, (start_point(sk26,sk25))).
% 0.20/0.41 cnf(i_0_197, negated_conjecture, (start_point(sk27,sk25))).
% 0.20/0.41 cnf(i_0_172, plain, (open(ax2_sk3(X1)))).
% 0.20/0.41 cnf(i_0_182, plain, (start_point(ax2_sk6(X1),X1))).
% 0.20/0.41 cnf(i_0_136, plain, (inner_point(ax0_sk8(X1),X1))).
% 0.20/0.41 cnf(i_0_198, negated_conjecture, (sk27!=sk26)).
% 0.20/0.41 cnf(i_0_148, plain, (~between_c(X1,X2,X3,X2))).
% 0.20/0.41 cnf(i_0_160, plain, (incident_o(X1,X2)|~start_point(X1,X2))).
% 0.20/0.41 cnf(i_0_121, plain, (~inner_point(X1,X2)|~end_point(X1,X2))).
% 0.20/0.41 cnf(i_0_130, plain, (~closed(X1)|~end_point(X2,X1))).
% 0.20/0.41 cnf(i_0_141, plain, (ax0_sk11(X1,X2)!=X1|~end_point(X1,X2))).
% 0.20/0.41 cnf(i_0_112, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
% 0.20/0.41 cnf(i_0_120, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
% 0.20/0.41 cnf(i_0_165, plain, (incident_o(X1,X2)|~finish_point(X1,X2))).
% 0.20/0.41 cnf(i_0_133, plain, (open(X1)|~end_point(X2,X1))).
% 0.20/0.41 cnf(i_0_131, plain, (closed(X1)|end_point(ax0_sk6(X1),X1))).
% 0.20/0.41 cnf(i_0_132, plain, (end_point(ax0_sk7(X1),X1)|~open(X1))).
% 0.20/0.41 cnf(i_0_124, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))).
% 0.20/0.41 cnf(i_0_123, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_171, plain, (incident_o(X1,X2)|~ordered_by(X2,X3,X1))).
% 0.20/0.41 cnf(i_0_170, plain, (incident_o(X1,X2)|~ordered_by(X2,X1,X3))).
% 0.20/0.41 cnf(i_0_134, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
% 0.20/0.41 cnf(i_0_162, plain, (start_point(X1,X2)|ax2_sk1(X2,X1)!=X1|~incident_o(X1,X2))).
% 0.20/0.41 cnf(i_0_102, plain, (part_of(X1,X2)|~incident_c(ax0_sk1(X1,X2),X2))).
% 0.20/0.41 cnf(i_0_174, plain, (incident_o(X1,X2)|~incident_c(X1,ax2_sk3(X2)))).
% 0.20/0.41 cnf(i_0_167, plain, (finish_point(X1,X2)|ax2_sk2(X2,X1)!=X1|~incident_o(X1,X2))).
% 0.20/0.41 cnf(i_0_173, plain, (incident_c(X1,ax2_sk3(X2))|~incident_o(X1,X2))).
% 0.20/0.41 cnf(i_0_101, plain, (incident_c(ax0_sk1(X1,X2),X1)|part_of(X1,X2))).
% 0.20/0.41 cnf(i_0_122, plain, (inner_point(X1,X2)|end_point(X1,X2)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_100, plain, (incident_c(X1,X2)|~incident_c(X1,X3)|~part_of(X3,X2))).
% 0.20/0.41 cnf(i_0_164, plain, (start_point(X1,X2)|~ordered_by(X2,X1,ax2_sk1(X2,X1)))).
% 0.20/0.41 cnf(i_0_169, plain, (finish_point(X1,X2)|~ordered_by(X2,ax2_sk2(X2,X1),X1))).
% 0.20/0.41 cnf(i_0_140, plain, (end_point(ax0_sk11(X1,X2),X2)|~end_point(X1,X2))).
% 0.20/0.41 cnf(i_0_190, plain, (incident_c(X1,underlying_curve(X2))|~incident_o(X1,X2))).
% 0.20/0.41 cnf(i_0_191, plain, (incident_o(X1,X2)|~incident_c(X1,underlying_curve(X2)))).
% 0.20/0.41 cnf(i_0_105, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X3))).
% 0.20/0.41 cnf(i_0_118, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)))).
% 0.20/0.41 cnf(i_0_119, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)))).
% 0.20/0.41 cnf(i_0_147, plain, (X1=X2|~incident_c(ax0_sk13(X1,X2),X2)|~incident_c(ax0_sk13(X1,X2),X1))).
% 0.20/0.41 cnf(i_0_195, plain, (X1=underlying_curve(X2)|~incident_o(ax2_sk10(X2,X1),X2)|~incident_c(ax2_sk10(X2,X1),X1))).
% 0.20/0.41 cnf(i_0_143, plain, (ax0_sk12(X1,X2)=sum(X2,X1)|~meet(X3,X2,X1))).
% 0.20/0.41 cnf(i_0_104, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_163, plain, (incident_o(ax2_sk1(X1,X2),X1)|start_point(X2,X1)|~incident_o(X2,X1))).
% 0.20/0.41 cnf(i_0_161, plain, (X1=X2|ordered_by(X3,X1,X2)|~incident_o(X2,X3)|~start_point(X1,X3))).
% 0.20/0.41 cnf(i_0_139, plain, (X1=X2|X1=X3|X2=X3|~end_point(X3,X4)|~end_point(X2,X4)|~end_point(X1,X4))).
% 0.20/0.41 cnf(i_0_116, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk3(X2,X1))|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_159, plain, (between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X2)|~ordered_by(X1,X4,X3))).
% 0.20/0.41 cnf(i_0_158, plain, (between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X4)|~ordered_by(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_126, plain, (end_point(X1,X2)|~meet(X3,X4,X2)|~incident_c(X1,X2)|~incident_c(X1,X4))).
% 0.20/0.41 cnf(i_0_125, plain, (end_point(X1,X2)|~meet(X3,X2,X4)|~incident_c(X1,X4)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_117, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk4(X2,X1))|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_114, plain, (end_point(X1,X2)|part_of(ax0_sk3(X2,X1),X2)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_115, plain, (end_point(X1,X2)|part_of(ax0_sk4(X2,X1),X2)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_168, plain, (finish_point(X1,X2)|incident_o(ax2_sk2(X2,X1),X2)|~incident_o(X1,X2))).
% 0.20/0.41 cnf(i_0_156, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)|~between_o(X1,X4,X2,X3))).
% 0.20/0.41 cnf(i_0_103, plain, (incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2)))).
% 0.20/0.41 cnf(i_0_154, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X4,X3)|~between_o(X1,X2,X3,X4))).
% 0.20/0.41 cnf(i_0_157, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X2,X4)|~between_o(X1,X3,X2,X4))).
% 0.20/0.41 cnf(i_0_155, plain, (ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)|~between_o(X1,X2,X3,X4))).
% 0.20/0.41 cnf(i_0_166, plain, (X1=X2|ordered_by(X3,X2,X1)|~finish_point(X1,X3)|~incident_o(X2,X3))).
% 0.20/0.41 cnf(i_0_138, plain, (sum(ax0_sk9(X1,X2),ax0_sk10(X1,X2))=X2|~inner_point(X1,X2))).
% 0.20/0.41 cnf(i_0_151, plain, (end_point(X1,ax1_sk1(X1,X2,X3,X4))|~between_c(X4,X3,X2,X1))).
% 0.20/0.41 cnf(i_0_150, plain, (end_point(X1,ax1_sk1(X2,X3,X1,X4))|~between_c(X4,X1,X3,X2))).
% 0.20/0.41 cnf(i_0_152, plain, (inner_point(X1,ax1_sk1(X2,X1,X3,X4))|~between_c(X4,X3,X1,X2))).
% 0.20/0.41 cnf(i_0_149, plain, (part_of(ax1_sk1(X1,X2,X3,X4),X4)|~between_c(X4,X3,X2,X1))).
% 0.20/0.41 cnf(i_0_144, plain, (X1=X2|incident_c(ax0_sk13(X1,X2),X1)|incident_c(ax0_sk13(X1,X2),X2))).
% 0.20/0.41 cnf(i_0_137, plain, (meet(X1,ax0_sk9(X1,X2),ax0_sk10(X1,X2))|~inner_point(X1,X2))).
% 0.20/0.41 cnf(i_0_176, plain, (incident_o(X1,X2)|~between_o(X2,X3,X4,X5)|~incident_c(X1,ax2_sk4(X2,X5,X4,X3)))).
% 0.20/0.41 cnf(i_0_110, plain, (X1=sum(X2,X3)|~incident_c(ax0_sk2(X3,X2,X1),X1)|~incident_c(ax0_sk2(X3,X2,X1),X2))).
% 0.20/0.41 cnf(i_0_111, plain, (X1=sum(X2,X3)|~incident_c(ax0_sk2(X3,X2,X1),X1)|~incident_c(ax0_sk2(X3,X2,X1),X3))).
% 0.20/0.41 cnf(i_0_183, plain, (X1=X2|incident_c(X3,X4)|~incident_o(X3,ax2_sk7(X4,X2,X1))|~open(X4)|~incident_c(X2,X4)|~incident_c(X1,X4))).
% 0.20/0.41 cnf(i_0_192, plain, (X1=underlying_curve(X2)|incident_o(ax2_sk10(X2,X1),X2)|incident_c(ax2_sk10(X2,X1),X1))).
% 0.20/0.41 cnf(i_0_177, plain, (between_c(ax2_sk4(X1,X2,X3,X4),X4,X3,X2)|~between_o(X1,X4,X3,X2))).
% 0.20/0.41 cnf(i_0_175, plain, (incident_c(X1,ax2_sk4(X2,X3,X4,X5))|~incident_o(X1,X2)|~between_o(X2,X5,X4,X3))).
% 0.20/0.41 cnf(i_0_128, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_127, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_113, 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.41 cnf(i_0_185, plain, (X1=X2|ordered_by(ax2_sk7(X3,X2,X1),X1,X2)|~open(X3)|~incident_c(X2,X3)|~incident_c(X1,X3))).
% 0.20/0.41 cnf(i_0_189, plain, (X1=X2|~ordered_by(X2,ax2_sk8(X1,X2),ax2_sk9(X1,X2))|~ordered_by(X1,ax2_sk8(X1,X2),ax2_sk9(X1,X2)))).
% 0.20/0.41 cnf(i_0_142, plain, (meet(X1,X2,X3)|~closed(sum(X2,X3))|~meet(X4,X2,X3)|~end_point(X1,X2))).
% 0.20/0.41 cnf(i_0_129, plain, (meet(X1,X2,X3)|~end_point(ax0_sk5(X3,X2,X1),X3)|~end_point(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.20/0.41 cnf(i_0_184, plain, (X1=X2|incident_o(X3,ax2_sk7(X4,X2,X1))|~open(X4)|~incident_c(X3,X4)|~incident_c(X2,X4)|~incident_c(X1,X4))).
% 0.20/0.41 cnf(i_0_153, 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.41 cnf(i_0_181, plain, (between_o(X1,X2,X3,X4)|~incident_o(ax2_sk5(X5,X1,X4,X3,X2),X1)|~between_c(X5,X2,X3,X4)|~incident_c(ax2_sk5(X5,X1,X4,X3,X2),X5))).
% 0.20/0.41 cnf(i_0_186, plain, (X1=X2|ordered_by(X1,ax2_sk8(X2,X1),ax2_sk9(X2,X1))|ordered_by(X2,ax2_sk8(X2,X1),ax2_sk9(X2,X1)))).
% 0.20/0.41 cnf(i_0_178, plain, (incident_o(ax2_sk5(X1,X2,X3,X4,X5),X2)|between_o(X2,X5,X4,X3)|incident_c(ax2_sk5(X1,X2,X3,X4,X5),X1)|~between_c(X1,X5,X4,X3))).
% 0.20/0.41 cnf(i_0_135, 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.41 cnf(i_0_106, plain, (X1=sum(X2,X3)|incident_c(ax0_sk2(X3,X2,X1),X3)|incident_c(ax0_sk2(X3,X2,X1),X2)|incident_c(ax0_sk2(X3,X2,X1),X1))).
% 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.41 # Begin printing tableau
% 0.20/0.41 # Found 5 steps
% 0.20/0.41 cnf(i_0_198, negated_conjecture, (sk27!=sk26), inference(start_rule)).
% 0.20/0.41 cnf(i_0_206, plain, (sk27!=sk26), inference(extension_rule, [i_0_186])).
% 0.20/0.41 cnf(i_0_436, plain, (ordered_by(sk27,ax2_sk8(sk26,sk27),ax2_sk9(sk26,sk27))), inference(extension_rule, [i_0_171])).
% 0.20/0.41 cnf(i_0_437, plain, (ordered_by(sk26,ax2_sk8(sk26,sk27),ax2_sk9(sk26,sk27))), inference(etableau_closure_rule, [i_0_437, ...])).
% 0.20/0.41 cnf(i_0_482, plain, (incident_o(ax2_sk9(sk26,sk27),sk27)), inference(etableau_closure_rule, [i_0_482, ...])).
% 0.20/0.41 # End printing tableau
% 0.20/0.41 # SZS output end
% 0.20/0.41 # Branches closed with saturation will be marked with an "s"
% 0.20/0.41 # Child (26717) has found a proof.
% 0.20/0.41
% 0.20/0.41 # Proof search is over...
% 0.20/0.41 # Freeing feature tree
%------------------------------------------------------------------------------