%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN603-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 : n013.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:45 EDT 2022 % Result : Unsatisfiable 22.67s 3.23s % Output : CNFRefutation 22.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYN603-1 : TPTP v8.1.0. Released v2.5.0. % 0.10/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 : n013.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 07:37:59 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 30 Number of unprocessed: 30 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 30 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 30 conjectures. % 0.12/0.37 # There are 30 start rule candidates: % 0.12/0.37 # Found 7 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 30 start rule tableaux created. % 0.12/0.37 # 23 extension rule candidate clauses % 0.12/0.37 # 7 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 22.67/3.23 # There were 3 total branch saturation attempts. % 22.67/3.23 # There were 0 of these attempts blocked. % 22.67/3.23 # There were 0 deferred branch saturation attempts. % 22.67/3.23 # There were 0 free duplicated saturations. % 22.67/3.23 # There were 2 total successful branch saturations. % 22.67/3.23 # There were 0 successful branch saturations in interreduction. % 22.67/3.23 # There were 0 successful branch saturations on the branch. % 22.67/3.23 # There were 2 successful branch saturations after the branch. % 22.67/3.23 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.67/3.23 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.67/3.23 # Begin clausification derivation % 22.67/3.23 % 22.67/3.23 # End clausification derivation % 22.67/3.23 # Begin listing active clauses obtained from FOF to CNF conversion % 22.67/3.23 cnf(i_0_31, negated_conjecture, (p14(c20))). % 22.67/3.23 cnf(i_0_33, negated_conjecture, (p15(c22,c21))). % 22.67/3.23 cnf(i_0_34, negated_conjecture, (p2(f3(c18),c19))). % 22.67/3.23 cnf(i_0_36, negated_conjecture, (p2(f3(f4(c16)),c17))). % 22.67/3.23 cnf(i_0_35, negated_conjecture, (p2(c22,f9(c20,c23)))). % 22.67/3.23 cnf(i_0_32, negated_conjecture, (p2(X1,X1))). % 22.67/3.23 cnf(i_0_49, negated_conjecture, (p2(f7(f8(c21,c22),c20),f6(f5(f4(c16)),f3(f4(c16)))))). % 22.67/3.23 cnf(i_0_38, negated_conjecture, (p15(f10(X1),c21)|~p13(X1,f5(c18)))). % 22.67/3.23 cnf(i_0_37, negated_conjecture, (p14(X1)|~p2(X2,X1)|~p14(X2))). % 22.67/3.23 cnf(i_0_44, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 22.67/3.23 cnf(i_0_42, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 22.67/3.23 cnf(i_0_43, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 22.67/3.23 cnf(i_0_40, negated_conjecture, (p2(f10(X1),f10(X2))|~p2(X1,X2))). % 22.67/3.23 cnf(i_0_46, negated_conjecture, (p2(f10(X1),f9(c20,f11(X1)))|~p13(X1,f5(c18)))). % 22.67/3.23 cnf(i_0_39, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 22.67/3.23 cnf(i_0_41, negated_conjecture, (p2(f11(X1),f11(X2))|~p2(X1,X2))). % 22.67/3.23 cnf(i_0_48, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 22.67/3.23 cnf(i_0_45, negated_conjecture, (p12(X1,f3(X1),f3(f5(X1)))|~p13(X1,c18))). % 22.67/3.23 cnf(i_0_47, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 22.67/3.23 cnf(i_0_50, negated_conjecture, (p2(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 22.67/3.23 cnf(i_0_53, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 22.67/3.23 cnf(i_0_52, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 22.67/3.23 cnf(i_0_51, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 22.67/3.23 cnf(i_0_56, negated_conjecture, (~p15(X1,c21)|~p2(f7(f8(c21,X1),c20),f6(f5(f4(c16)),c17))|~p2(X1,f9(c20,X2)))). % 22.67/3.23 cnf(i_0_54, negated_conjecture, (p2(f7(f8(c21,f10(X1)),c20),f6(f5(X1),f3(X1)))|~p13(X1,f5(c18)))). % 22.67/3.23 cnf(i_0_57, negated_conjecture, (p2(X1,c22)|~p15(X1,c21)|~p2(f7(f8(c21,X1),c20),f6(f5(f4(c16)),X2))|~p2(X1,f9(c20,X3)))). % 22.67/3.23 cnf(i_0_58, negated_conjecture, (p2(X1,f3(f4(c16)))|~p15(X2,c21)|~p2(f7(f8(c21,X2),c20),f6(f5(f4(c16)),X1))|~p2(X2,f9(c20,X3)))). % 22.67/3.23 cnf(i_0_55, negated_conjecture, (p12(X1,X2,X3)|~p12(X4,X5,X6)|~p2(X4,X1)|~p2(X5,X2)|~p2(X6,X3))). % 22.67/3.23 cnf(i_0_59, negated_conjecture, (p2(X1,f3(X2))|~p13(X2,f5(c18))|~p15(X3,c21)|~p2(f7(f8(c21,X3),c20),f6(f5(X2),X1))|~p2(X3,f9(c20,X4)))). % 22.67/3.23 cnf(i_0_60, negated_conjecture, (p2(X1,f10(X2))|~p13(X2,f5(c18))|~p15(X1,c21)|~p2(f7(f8(c21,X1),c20),f6(f5(X2),X3))|~p2(X1,f9(c20,X4)))). % 22.67/3.23 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 22.67/3.23 # Begin printing tableau % 22.67/3.23 # Found 8 steps % 22.67/3.23 cnf(i_0_41, negated_conjecture, (p2(f11(f7(f8(c21,c22),c20)),f11(f6(f5(f4(c16)),f3(f4(c16)))))|~p2(f7(f8(c21,c22),c20),f6(f5(f4(c16)),f3(f4(c16))))), inference(start_rule)). % 22.67/3.23 cnf(i_0_112, plain, (~p2(f7(f8(c21,c22),c20),f6(f5(f4(c16)),f3(f4(c16))))), inference(closure_rule, [i_0_49])). % 22.67/3.23 cnf(i_0_111, plain, (p2(f11(f7(f8(c21,c22),c20)),f11(f6(f5(f4(c16)),f3(f4(c16)))))), inference(extension_rule, [i_0_55])). % 22.67/3.23 cnf(i_0_2699, plain, (~p12(f11(f7(f8(c21,c22),c20)),f3(f11(f7(f8(c21,c22),c20))),f3(f5(f11(f7(f8(c21,c22),c20)))))), inference(extension_rule, [i_0_45])). % 22.67/3.23 cnf(i_0_2702, plain, (~p2(f3(f5(f11(f7(f8(c21,c22),c20)))),f3(f5(f11(f7(f8(c21,c22),c20)))))), inference(closure_rule, [i_0_32])). % 22.67/3.23 cnf(i_0_2701, plain, (~p2(f3(f11(f7(f8(c21,c22),c20))),f3(f11(f7(f8(c21,c22),c20))))), inference(closure_rule, [i_0_32])). % 22.67/3.23 cnf(i_0_2698, plain, (p12(f11(f6(f5(f4(c16)),f3(f4(c16)))),f3(f11(f7(f8(c21,c22),c20))),f3(f5(f11(f7(f8(c21,c22),c20)))))), inference(etableau_closure_rule, [i_0_2698, ...])). % 22.67/3.23 cnf(i_0_99350, plain, (~p13(f11(f7(f8(c21,c22),c20)),c18)), inference(etableau_closure_rule, [i_0_99350, ...])). % 22.67/3.23 # End printing tableau % 22.67/3.23 # SZS output end % 22.67/3.23 # Branches closed with saturation will be marked with an "s" % 22.67/3.24 # Child (18985) has found a proof. % 22.67/3.24 % 22.67/3.24 # Proof search is over... % 22.67/3.24 # Freeing feature tree %------------------------------------------------------------------------------