%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN586-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 : n007.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:38 EDT 2022 % Result : Unsatisfiable 0.19s 0.38s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN586-1 : TPTP v8.1.0. Released v2.5.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 : n007.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 : Mon Jul 11 17:46:48 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 26 Number of unprocessed: 26 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 26 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 26 conjectures. % 0.19/0.37 # There are 26 start rule candidates: % 0.19/0.37 # Found 9 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 26 start rule tableaux created. % 0.19/0.37 # 17 extension rule candidate clauses % 0.19/0.37 # 9 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 1 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_31, negated_conjecture, (p3(c21,c19))). % 0.19/0.38 cnf(i_0_44, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))). % 0.19/0.38 cnf(i_0_48, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))). % 0.19/0.38 cnf(i_0_27, negated_conjecture, (p12(X1,X1))). % 0.19/0.38 cnf(i_0_28, negated_conjecture, (p5(X1,X1))). % 0.19/0.38 cnf(i_0_29, negated_conjecture, (p3(X1,X1))). % 0.19/0.38 cnf(i_0_30, negated_conjecture, (p2(X1,X1))). % 0.19/0.38 cnf(i_0_32, negated_conjecture, (~p12(f13(c20),f13(c18)))). % 0.19/0.38 cnf(i_0_49, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))). % 0.19/0.38 cnf(i_0_39, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.19/0.38 cnf(i_0_40, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.19/0.38 cnf(i_0_33, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))). % 0.19/0.38 cnf(i_0_34, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))). % 0.19/0.38 cnf(i_0_35, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))). % 0.19/0.38 cnf(i_0_36, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))). % 0.19/0.38 cnf(i_0_37, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))). % 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))). % 0.19/0.38 cnf(i_0_41, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.19/0.38 cnf(i_0_42, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.38 cnf(i_0_43, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.19/0.38 cnf(i_0_45, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))). % 0.19/0.38 cnf(i_0_47, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))). % 0.19/0.38 cnf(i_0_46, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.19/0.38 cnf(i_0_51, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))). % 0.19/0.38 cnf(i_0_50, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))). % 0.19/0.38 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 8 steps % 0.19/0.38 cnf(i_0_51, negated_conjecture, (p12(f13(c20),f13(c18))|~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))),c20)), inference(start_rule)). % 0.19/0.38 cnf(i_0_61, plain, (p12(f13(c20),f13(c18))), inference(closure_rule, [i_0_32])). % 0.19/0.38 cnf(i_0_62, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))),c20)), inference(extension_rule, [i_0_43])). % 0.19/0.38 cnf(i_0_129, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20)), inference(closure_rule, [i_0_48])). % 0.19/0.38 cnf(i_0_130, plain, (~p2(c20,c20)), inference(closure_rule, [i_0_30])). % 0.19/0.38 cnf(i_0_131, plain, (~p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))))), inference(extension_rule, [i_0_46])). % 0.19/0.38 cnf(i_0_143, plain, (~p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18)))), inference(closure_rule, [i_0_30])). % 0.19/0.38 cnf(i_0_144, plain, (~p3(f11(c21),f11(f14(c20,c16)))), inference(etableau_closure_rule, [i_0_144, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # Child (10525) has found a proof. % 0.19/0.38 % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------