%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN553-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 : n011.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:25 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN553-1 : TPTP v8.1.0. Released v2.5.0. % 0.11/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 : n011.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 13:56:42 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V % 0.12/0.36 # and selection function PSelectComplexExceptRRHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 9 Number of unprocessed: 9 % 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 # 9 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 9 conjectures. % 0.12/0.36 # There are 9 start rule candidates: % 0.12/0.36 # Found 7 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 9 start rule tableaux created. % 0.12/0.36 # 2 extension rule candidate clauses % 0.12/0.36 # 7 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # There were 3 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 3 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 3 successful branch saturations after the branch. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_11, negated_conjecture, (p2(c3,c4))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (p2(X1,X1))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (p2(f8(X1,X2),f8(X2,X1)))). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~p2(c3,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (~p2(c4,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_18, negated_conjecture, (~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X1,X3))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 6 steps % 0.12/0.37 cnf(i_0_14, negated_conjecture, (p2(f8(X7,X8),f8(X8,X7))), inference(start_rule)). % 0.12/0.37 cnf(i_0_29, plain, (p2(f8(X7,X8),f8(X8,X7))), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_34, plain, (~p2(f8(X13,f8(X12,X11)),f8(f8(X13,X12),X11))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_32, plain, (p2(f8(f8(X13,f8(X12,X11)),f8(X7,X8)),f8(f8(f8(X13,X12),X11),f8(X8,X7)))), inference(extension_rule, [i_0_15])). % 0.12/0.37 cnf(i_0_37, plain, (~p2(f8(X13,f8(f8(X12,X11),f8(X7,X8))),f8(f8(X13,f8(X12,X11)),f8(X7,X8)))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_35, plain, (p2(f8(X13,f8(f8(X12,X11),f8(X7,X8))),f8(f8(f8(X13,X12),X11),f8(X8,X7)))), inference(etableau_closure_rule, [i_0_35, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_11, negated_conjecture, (p2(c3,c4))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (p2(X1,X1))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (p2(f8(X1,X2),f8(X2,X1)))). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~p2(c3,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (~p2(c4,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_18, negated_conjecture, (~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X1,X3))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 6 steps % 0.12/0.37 cnf(i_0_16, negated_conjecture, (p2(f8(X7,f8(X8,X12)),f8(f8(X7,X8),X12))), inference(start_rule)). % 0.12/0.37 cnf(i_0_28, plain, (p2(f8(X7,f8(X8,X12)),f8(f8(X7,X8),X12))), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_34, plain, (~p2(f8(X15,f8(X14,X13)),f8(f8(X15,X14),X13))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_32, plain, (p2(f8(f8(X15,f8(X14,X13)),f8(X7,f8(X8,X12))),f8(f8(f8(X15,X14),X13),f8(f8(X7,X8),X12)))), inference(extension_rule, [i_0_15])). % 0.12/0.37 cnf(i_0_37, plain, (~p2(f8(X15,f8(f8(X14,X13),f8(X7,f8(X8,X12)))),f8(f8(X15,f8(X14,X13)),f8(X7,f8(X8,X12))))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_35, plain, (p2(f8(X15,f8(f8(X14,X13),f8(X7,f8(X8,X12)))),f8(f8(f8(X15,X14),X13),f8(f8(X7,X8),X12)))), inference(etableau_closure_rule, [i_0_35, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_11, negated_conjecture, (p2(c3,c4))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (p2(X1,X1))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (p2(f8(X1,X2),f8(X2,X1)))). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~p2(c3,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (~p2(c4,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_18, negated_conjecture, (~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X1,X3))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 8 steps % 0.12/0.37 cnf(i_0_15, negated_conjecture, (p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4)))|~p2(f8(f8(f9(c3),c4),f9(c4)),f8(f9(c4),f8(f9(c3),c4)))|~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f8(f9(c3),c4),f9(c4)))), inference(start_rule)). % 0.12/0.37 cnf(i_0_22, plain, (p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4)))), inference(closure_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_23, plain, (~p2(f8(f8(f9(c3),c4),f9(c4)),f8(f9(c4),f8(f9(c3),c4)))), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_24, plain, (~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f8(f9(c3),c4),f9(c4)))), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_34, plain, (~p2(f8(f9(c4),c4),f8(f9(c3),c4))), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_74, plain, (~p2(c4,c4)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_33, plain, (~p2(f9(c3),f9(c4))), inference(etableau_closure_rule, [i_0_33, ...])). % 0.12/0.37 cnf(i_0_75, plain, (~p2(f9(c4),f9(c3))), inference(etableau_closure_rule, [i_0_75, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_11, negated_conjecture, (p2(c3,c4))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (p2(X1,X1))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (p2(f8(X1,X2),f8(X2,X1)))). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~p2(c3,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (~p2(c4,f5(f6(c7))))). % 0.12/0.37 cnf(i_0_18, negated_conjecture, (~p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X1,X3))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 6 steps % 0.12/0.37 cnf(i_0_10, negated_conjecture, (p2(X8,X8)), inference(start_rule)). % 0.12/0.37 cnf(i_0_30, plain, (p2(X8,X8)), inference(extension_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_34, plain, (~p2(f8(X11,f8(X10,X9)),f8(f8(X11,X10),X9))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_32, plain, (p2(f8(f8(X11,f8(X10,X9)),X8),f8(f8(f8(X11,X10),X9),X8))), inference(extension_rule, [i_0_15])). % 0.12/0.37 cnf(i_0_37, plain, (~p2(f8(X11,f8(f8(X10,X9),X8)),f8(f8(X11,f8(X10,X9)),X8))), inference(closure_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_35, plain, (p2(f8(X11,f8(f8(X10,X9),X8)),f8(f8(f8(X11,X10),X9),X8))), inference(etableau_closure_rule, [i_0_35, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (817) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------