%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN614-1 : TPTP v8.1.0. Released v2.5.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 : n028.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 : Thu Jul 21 06:12:50 EDT 2022 % Result : Unsatisfiable 11.01s 1.82s % Output : CNFRefutation 11.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SYN614-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n028.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 12 02:10:59 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.45 # No SInE strategy applied % 0.18/0.45 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.18/0.45 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.18/0.45 # % 0.18/0.45 # Number of axioms: 31 Number of unprocessed: 31 % 0.18/0.45 # Tableaux proof search. % 0.18/0.45 # APR header successfully linked. % 0.18/0.45 # Hello from C++ % 0.18/0.45 # The folding up rule is enabled... % 0.18/0.45 # Local unification is enabled... % 0.18/0.45 # Any saturation attempts will use folding labels... % 0.18/0.45 # 31 beginning clauses after preprocessing and clausification % 0.18/0.45 # Creating start rules for all 31 conjectures. % 0.18/0.45 # There are 31 start rule candidates: % 0.18/0.45 # Found 10 unit axioms. % 0.18/0.45 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.45 # 31 start rule tableaux created. % 0.18/0.45 # 21 extension rule candidate clauses % 0.18/0.45 # 10 unit axiom clauses % 0.18/0.45 % 0.18/0.45 # Requested 8, 32 cores available to the main process. % 11.01/1.82 # There were 1 total branch saturation attempts. % 11.01/1.82 # There were 0 of these attempts blocked. % 11.01/1.82 # There were 0 deferred branch saturation attempts. % 11.01/1.82 # There were 0 free duplicated saturations. % 11.01/1.82 # There were 1 total successful branch saturations. % 11.01/1.82 # There were 0 successful branch saturations in interreduction. % 11.01/1.82 # There were 0 successful branch saturations on the branch. % 11.01/1.82 # There were 1 successful branch saturations after the branch. % 11.01/1.82 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.01/1.82 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.01/1.82 # Begin clausification derivation % 11.01/1.82 % 11.01/1.82 # End clausification derivation % 11.01/1.82 # Begin listing active clauses obtained from FOF to CNF conversion % 11.01/1.82 cnf(i_0_32, negated_conjecture, (p13(X1,X1))). % 11.01/1.82 cnf(i_0_33, negated_conjecture, (p7(X1,X1))). % 11.01/1.82 cnf(i_0_34, negated_conjecture, (p2(X1,X1))). % 11.01/1.82 cnf(i_0_35, negated_conjecture, (p15(X1,X1))). % 11.01/1.82 cnf(i_0_36, negated_conjecture, (~p2(c21,f3(c22)))). % 11.01/1.82 cnf(i_0_37, negated_conjecture, (p19(c23,f3(f4(f5(c22)))))). % 11.01/1.82 cnf(i_0_39, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))). % 11.01/1.82 cnf(i_0_43, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))). % 11.01/1.82 cnf(i_0_40, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 11.01/1.82 cnf(i_0_42, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 11.01/1.82 cnf(i_0_41, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 11.01/1.82 cnf(i_0_45, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))). % 11.01/1.82 cnf(i_0_46, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 11.01/1.82 cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 11.01/1.82 cnf(i_0_48, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))). % 11.01/1.82 cnf(i_0_51, negated_conjecture, (p19(X1,X2)|~p2(X4,X2)|~p2(X3,X1)|~p19(X3,X4))). % 11.01/1.82 cnf(i_0_50, negated_conjecture, (p20(X1,X2)|~p2(X4,X1)|~p2(X3,X2)|~p20(X4,X3))). % 11.01/1.82 cnf(i_0_38, negated_conjecture, (p20(c24,f6(f3(f4(f5(c22))),c21)))). % 11.01/1.82 cnf(i_0_52, negated_conjecture, (p13(f16(X1,X2),f16(X3,X4))|~p2(X1,X3)|~p15(X2,X4))). % 11.01/1.82 cnf(i_0_53, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 11.01/1.82 cnf(i_0_54, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 11.01/1.82 cnf(i_0_55, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(X2,X4))). % 11.01/1.82 cnf(i_0_56, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 11.01/1.82 cnf(i_0_58, negated_conjecture, (p2(f14(X1,X2),f14(X3,X4))|~p13(X1,X3)|~p7(X2,X4))). % 11.01/1.82 cnf(i_0_57, negated_conjecture, (p2(f18(X1,X2),f18(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 11.01/1.82 cnf(i_0_59, negated_conjecture, (p15(f17(X1,X2),f17(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 11.01/1.82 cnf(i_0_44, negated_conjecture, (p2(c26,f14(f16(c28,f17(c21,c27)),c25)))). % 11.01/1.82 cnf(i_0_49, negated_conjecture, (p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),c24))). % 11.01/1.82 cnf(i_0_60, negated_conjecture, (p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))))). % 11.01/1.82 cnf(i_0_61, negated_conjecture, (~p19(X1,f3(f4(f5(c22))))|~p20(X2,f6(f3(f4(f5(c22))),c21))|~p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22))|~p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X1),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(X2),f10(f11(f3(f4(f5(c22)))),c27))))))). % 11.01/1.82 cnf(i_0_62, negated_conjecture, (~p19(X1,f3(f4(f5(c22))))|~p20(X2,f6(f3(f4(f5(c22))),c21))|~p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),X2)|~p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X1),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(X2),f10(f11(f3(f4(f5(c22)))),c27))))))). % 11.01/1.82 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 11.01/1.82 # Begin printing tableau % 11.01/1.82 # Found 7 steps % 11.01/1.82 cnf(i_0_49, negated_conjecture, (p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),c24)), inference(start_rule)). % 11.01/1.82 cnf(i_0_72, plain, (p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),c24)), inference(extension_rule, [i_0_62])). % 11.01/1.82 cnf(i_0_135, plain, (~p19(c23,f3(f4(f5(c22))))), inference(closure_rule, [i_0_37])). % 11.01/1.82 cnf(i_0_136, plain, (~p20(c24,f6(f3(f4(f5(c22))),c21))), inference(closure_rule, [i_0_38])). % 11.01/1.82 cnf(i_0_138, plain, (~p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))))), inference(extension_rule, [i_0_46])). % 11.01/1.82 cnf(i_0_182, plain, (~p7(f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))),f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))))), inference(closure_rule, [i_0_33])). % 11.01/1.82 cnf(i_0_183, plain, (~p7(f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))),c25)), inference(etableau_closure_rule, [i_0_183, ...])). % 11.01/1.82 # End printing tableau % 11.01/1.82 # SZS output end % 11.01/1.82 # Branches closed with saturation will be marked with an "s" % 11.01/1.82 # Child (25038) has found a proof. % 11.01/1.82 % 11.01/1.82 # Proof search is over... % 11.01/1.82 # Freeing feature tree %------------------------------------------------------------------------------