%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO084-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 : n023.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:41 EDT 2022 % Result : Unsatisfiable 23.54s 3.32s % Output : CNFRefutation 23.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : GEO084-1 : TPTP v8.1.0. Released v2.4.0. % 0.06/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 : n023.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.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jun 17 22:50:19 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Number of axioms: 47 Number of unprocessed: 47 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 47 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 4 conjectures. % 0.13/0.36 # There are 4 start rule candidates: % 0.13/0.36 # Found 5 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 4 start rule tableaux created. % 0.13/0.36 # 42 extension rule candidate clauses % 0.13/0.36 # 5 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 13 tableaux to operate on % 23.54/3.32 # There were 3 total branch saturation attempts. % 23.54/3.32 # There were 0 of these attempts blocked. % 23.54/3.32 # There were 0 deferred branch saturation attempts. % 23.54/3.32 # There were 0 free duplicated saturations. % 23.54/3.32 # There were 2 total successful branch saturations. % 23.54/3.32 # There were 0 successful branch saturations in interreduction. % 23.54/3.32 # There were 0 successful branch saturations on the branch. % 23.54/3.32 # There were 2 successful branch saturations after the branch. % 23.54/3.32 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.54/3.32 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.54/3.32 # Begin clausification derivation % 23.54/3.32 % 23.54/3.32 # End clausification derivation % 23.54/3.32 # Begin listing active clauses obtained from FOF to CNF conversion % 23.54/3.32 cnf(i_0_101, negated_conjecture, (part_of(sk14,sk16))). % 23.54/3.32 cnf(i_0_102, negated_conjecture, (part_of(sk15,sk16))). % 23.54/3.32 cnf(i_0_89, plain, (inner_point(ax0_sk8(X1),X1))). % 23.54/3.32 cnf(i_0_84, plain, (closed(X1)|end_point(ax0_sk6(X1),X1))). % 23.54/3.32 cnf(i_0_86, plain, (open(X2)|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_85, plain, (end_point(ax0_sk7(X1),X1)|~open(X1))). % 23.54/3.32 cnf(i_0_87, plain, (X1=X2|open(X1)|~part_of(X1,X2))). % 23.54/3.32 cnf(i_0_83, plain, (~closed(X1)|~end_point(X2,X1))). % 23.54/3.32 cnf(i_0_65, plain, (incident_c(X1,X2)|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_73, plain, (incident_c(X1,X2)|~inner_point(X1,X2))). % 23.54/3.32 cnf(i_0_74, plain, (~end_point(X1,X2)|~inner_point(X1,X2))). % 23.54/3.32 cnf(i_0_94, plain, (ax0_sk11(X1,X2)!=X1|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_103, negated_conjecture, (meet(sk17,sk14,sk15))). % 23.54/3.32 cnf(i_0_104, negated_conjecture, (~part_of(sum(sk14,sk15),sk16))). % 23.54/3.32 cnf(i_0_75, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_54, plain, (part_of(X1,X2)|incident_c(ax0_sk1(X1,X2),X1))). % 23.54/3.32 cnf(i_0_53, plain, (incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1))). % 23.54/3.32 cnf(i_0_58, plain, (incident_c(X4,X1)|X1!=sum(X2,X3)|~incident_c(X4,X3))). % 23.54/3.32 cnf(i_0_57, plain, (incident_c(X4,X1)|X1!=sum(X2,X3)|~incident_c(X4,X2))). % 23.54/3.32 cnf(i_0_93, plain, (end_point(ax0_sk11(X1,X2),X2)|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_92, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_56, plain, (incident_c(X4,X3)|incident_c(X4,X2)|X1!=sum(X2,X3)|~incident_c(X4,X1))). % 23.54/3.32 cnf(i_0_69, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk3(X2,X1))|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_70, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk4(X2,X1))|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_67, plain, (end_point(X1,X2)|part_of(ax0_sk3(X2,X1),X2)|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_68, plain, (end_point(X1,X2)|part_of(ax0_sk4(X2,X1),X2)|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_55, plain, (part_of(X1,X2)|~incident_c(ax0_sk1(X1,X2),X2))). % 23.54/3.32 cnf(i_0_97, plain, (X1=X2|incident_c(ax0_sk13(X1,X2),X2)|incident_c(ax0_sk13(X1,X2),X1))). % 23.54/3.32 cnf(i_0_91, plain, (sum(ax0_sk9(X1,X2),ax0_sk10(X1,X2))=X2|~inner_point(X1,X2))). % 23.54/3.32 cnf(i_0_77, plain, (incident_c(X1,X3)|~meet(X1,X2,X3))). % 23.54/3.32 cnf(i_0_76, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))). % 23.54/3.32 cnf(i_0_96, plain, (ax0_sk12(X3,X2)=sum(X2,X3)|~meet(X1,X2,X3))). % 23.54/3.32 cnf(i_0_100, plain, (X1=X2|~incident_c(ax0_sk13(X1,X2),X2)|~incident_c(ax0_sk13(X1,X2),X1))). % 23.54/3.32 cnf(i_0_90, plain, (meet(X1,ax0_sk9(X1,X2),ax0_sk10(X1,X2))|~inner_point(X1,X2))). % 23.54/3.32 cnf(i_0_71, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)))). % 23.54/3.32 cnf(i_0_72, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)))). % 23.54/3.32 cnf(i_0_66, plain, (part_of(X4,X3)|part_of(X3,X4)|~part_of(X4,X2)|~part_of(X3,X2)|~incident_c(X1,X4)|~incident_c(X1,X3)|~end_point(X1,X2))). % 23.54/3.32 cnf(i_0_79, plain, (end_point(X4,X3)|~incident_c(X4,X3)|~incident_c(X4,X2)|~meet(X1,X2,X3))). % 23.54/3.32 cnf(i_0_78, plain, (end_point(X4,X2)|~incident_c(X4,X3)|~incident_c(X4,X2)|~meet(X1,X2,X3))). % 23.54/3.32 cnf(i_0_95, plain, (meet(X5,X3,X4)|X1!=sum(X3,X4)|~closed(X1)|~end_point(X5,X3)|~meet(X2,X3,X4))). % 23.54/3.32 cnf(i_0_81, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_80, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 23.54/3.32 cnf(i_0_88, plain, (part_of(X4,X3)|part_of(X4,X1)|part_of(X3,X4)|part_of(X3,X1)|part_of(X1,X4)|part_of(X1,X3)|~part_of(X4,X2)|~part_of(X3,X2)|~part_of(X1,X2)|~end_point(X5,X4)|~end_point(X5,X3)|~end_point(X5,X1))). % 23.54/3.32 cnf(i_0_59, plain, (X3=sum(X2,X1)|incident_c(ax0_sk2(X1,X2,X3),X3)|incident_c(ax0_sk2(X1,X2,X3),X2)|incident_c(ax0_sk2(X1,X2,X3),X1))). % 23.54/3.32 cnf(i_0_63, plain, (X3=sum(X2,X1)|~incident_c(ax0_sk2(X1,X2,X3),X3)|~incident_c(ax0_sk2(X1,X2,X3),X2))). % 23.54/3.32 cnf(i_0_64, plain, (X3=sum(X2,X1)|~incident_c(ax0_sk2(X1,X2,X3),X3)|~incident_c(ax0_sk2(X1,X2,X3),X1))). % 23.54/3.32 cnf(i_0_82, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(ax0_sk5(X3,X2,X1),X3)|~end_point(ax0_sk5(X3,X2,X1),X2))). % 23.54/3.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 23.54/3.32 # Begin printing tableau % 23.54/3.32 # Found 6 steps % 23.54/3.32 cnf(i_0_103, negated_conjecture, (meet(sk17,sk14,sk15)), inference(start_rule)). % 23.54/3.32 cnf(i_0_106, plain, (meet(sk17,sk14,sk15)), inference(extension_rule, [i_0_77])). % 23.54/3.32 cnf(i_0_309, plain, (incident_c(sk17,sk15)), inference(extension_rule, [i_0_75])). % 23.54/3.32 cnf(i_0_330, plain, (end_point(sk17,sk15)), inference(extension_rule, [i_0_86])). % 23.54/3.32 cnf(i_0_331, plain, (inner_point(sk17,sk15)), inference(etableau_closure_rule, [i_0_331, ...])). % 23.54/3.32 cnf(i_0_159366, plain, (open(sk15)), inference(etableau_closure_rule, [i_0_159366, ...])). % 23.54/3.32 # End printing tableau % 23.54/3.32 # SZS output end % 23.54/3.32 # Branches closed with saturation will be marked with an "s" % 23.54/3.33 # Child (10399) has found a proof. % 23.54/3.33 % 23.54/3.33 # Proof search is over... % 23.54/3.33 # Freeing feature tree %------------------------------------------------------------------------------