%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN576-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:34 EDT 2022 % Result : Unsatisfiable 0.18s 0.43s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN576-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 : n007.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 : Mon Jul 11 12:09:32 EDT 2022 % 0.12/0.33 % 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_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 22 Number of unprocessed: 22 % 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.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 22 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 22 conjectures. % 0.12/0.36 # There are 22 start rule candidates: % 0.12/0.36 # Found 8 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 22 start rule tableaux created. % 0.12/0.36 # 14 extension rule candidate clauses % 0.12/0.36 # 8 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.43 # There were 1 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 0 free duplicated saturations. % 0.18/0.43 # There were 1 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 1 successful branch saturations after the branch. % 0.18/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_27, negated_conjecture, (p12(c15,f6(c13)))). % 0.18/0.43 cnf(i_0_28, negated_conjecture, (p12(c16,f6(c13)))). % 0.18/0.43 cnf(i_0_23, negated_conjecture, (p8(X1,X1))). % 0.18/0.43 cnf(i_0_24, negated_conjecture, (p2(X1,X1))). % 0.18/0.43 cnf(i_0_25, negated_conjecture, (p4(X1,X1))). % 0.18/0.43 cnf(i_0_26, negated_conjecture, (p5(X1,X1))). % 0.18/0.43 cnf(i_0_30, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))). % 0.18/0.43 cnf(i_0_39, negated_conjecture, (~p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)))). % 0.18/0.43 cnf(i_0_29, negated_conjecture, (p11(X1,X2)|p11(X2,X1))). % 0.18/0.43 cnf(i_0_33, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.18/0.43 cnf(i_0_34, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.43 cnf(i_0_35, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.18/0.43 cnf(i_0_32, negated_conjecture, (p2(f10(X1),f10(X2))|~p2(X1,X2))). % 0.18/0.43 cnf(i_0_31, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))). % 0.18/0.43 cnf(i_0_36, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.18/0.43 cnf(i_0_40, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.43 cnf(i_0_38, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p5(X4,X2)|~p2(X3,X1))). % 0.18/0.43 cnf(i_0_41, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.43 cnf(i_0_37, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.18/0.43 cnf(i_0_42, negated_conjecture, (p2(f9(X1,X2,X3),f9(X4,X5,X6))|~p4(X1,X4)|~p2(X3,X6)|~p8(X2,X5))). % 0.18/0.43 cnf(i_0_43, negated_conjecture, (p12(f7(f9(X1,c14,f3(X2,X3)),X3),f6(X1))|~p11(f10(X2),f10(X3))|~p12(X3,f6(X1))|~p12(X2,f6(X1)))). % 0.18/0.43 cnf(i_0_44, negated_conjecture, (p12(f7(f9(X1,c14,f3(X2,X3)),f3(X2,X3)),f6(X1))|~p11(f10(X2),f10(X3))|~p12(X3,f6(X1))|~p12(X2,f6(X1)))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 10 steps % 0.18/0.43 cnf(i_0_42, negated_conjecture, (p2(f9(X21,X20,f3(X19,X18)),f9(X21,X20,f3(X18,X19)))|~p4(X21,X21)|~p2(f3(X19,X18),f3(X18,X19))|~p8(X20,X20)), inference(start_rule)). % 0.18/0.43 cnf(i_0_54, plain, (~p4(X21,X21)), inference(closure_rule, [i_0_25])). % 0.18/0.43 cnf(i_0_55, plain, (~p2(f3(X19,X18),f3(X18,X19))), inference(closure_rule, [i_0_30])). % 0.18/0.43 cnf(i_0_56, plain, (~p8(X20,X20)), inference(closure_rule, [i_0_23])). % 0.18/0.43 cnf(i_0_53, plain, (p2(f9(X21,X20,f3(X19,X18)),f9(X21,X20,f3(X18,X19)))), inference(extension_rule, [i_0_42])). % 0.18/0.43 cnf(i_0_106, plain, (~p4(X8,X8)), inference(closure_rule, [i_0_25])). % 0.18/0.43 cnf(i_0_108, plain, (~p8(X9,X9)), inference(closure_rule, [i_0_23])). % 0.18/0.43 cnf(i_0_105, plain, (p2(f9(X8,X9,f9(X21,X20,f3(X19,X18))),f9(X8,X9,f9(X21,X20,f3(X18,X19))))), inference(extension_rule, [i_0_41])). % 0.18/0.43 cnf(i_0_469, plain, (~p2(f3(X1,X2),f3(X2,X1))), inference(closure_rule, [i_0_30])). % 0.18/0.43 cnf(i_0_467, plain, (p2(f7(f3(X1,X2),f9(X8,X9,f9(X21,X20,f3(X19,X18)))),f7(f3(X2,X1),f9(X8,X9,f9(X21,X20,f3(X18,X19)))))), inference(etableau_closure_rule, [i_0_467, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.44 # Child (26832) has found a proof. % 0.18/0.44 % 0.18/0.44 # Proof search is over... % 0.18/0.44 # Freeing feature tree %------------------------------------------------------------------------------