%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.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 : n022.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 : Sat Jul 16 14:11:20 EDT 2022 % Result : Unsatisfiable 0.19s 0.36s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0. % 0.03/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 : n022.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 : Fri Jun 17 04:22:32 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 5 Number of unprocessed: 5 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 5 beginning clauses after preprocessing and clausification % 0.19/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.19/0.36 # No conjectures. % 0.19/0.36 # There are 5 start rule candidates: % 0.19/0.36 # Found 4 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 5 start rule tableaux created. % 0.19/0.36 # 1 extension rule candidate clauses % 0.19/0.36 # 4 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 5 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 10 tableaux to operate on % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # Begin clausification derivation % 0.19/0.36 % 0.19/0.36 # End clausification derivation % 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.36 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.36 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.36 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.36 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.36 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.36 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 6 steps % 0.19/0.36 cnf(i_0_8, plain, (unpack1(X9,pack1(X9))=X9), inference(start_rule)). % 0.19/0.36 cnf(i_0_38, plain, (unpack1(X9,pack1(X9))=X9), inference(extension_rule, [i_0_37])). % 0.19/0.36 cnf(i_0_59, plain, (unpack1(X3,pack1(X3))!=X3), inference(closure_rule, [i_0_8])). % 0.19/0.36 cnf(i_0_58, plain, (unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9)))=unpack1(X3,X9)), inference(extension_rule, [i_0_34])). % 0.19/0.36 cnf(i_0_67, plain, (unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9)))=inv(unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9))))), inference(closure_rule, [i_0_7])). % 0.19/0.36 cnf(i_0_69, plain, (unpack1(X3,X9)!=inv(unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9))))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.36 # Begin clausification derivation % 0.19/0.36 % 0.19/0.36 # End clausification derivation % 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.36 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.36 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.36 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.36 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.36 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.36 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 6 steps % 0.19/0.36 cnf(i_0_8, plain, (unpack1(X3,pack1(X3))=X3), inference(start_rule)). % 0.19/0.36 cnf(i_0_38, plain, (unpack1(X3,pack1(X3))=X3), inference(extension_rule, [i_0_37])). % 0.19/0.36 cnf(i_0_60, plain, (unpack1(X9,pack1(X9))!=X9), inference(closure_rule, [i_0_8])). % 0.19/0.36 cnf(i_0_58, plain, (unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9)))=unpack1(X3,X9)), inference(extension_rule, [i_0_34])). % 0.19/0.36 cnf(i_0_67, plain, (unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9)))=inv(unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9))))), inference(closure_rule, [i_0_7])). % 0.19/0.36 cnf(i_0_69, plain, (unpack1(X3,X9)!=inv(unpack1(unpack1(X3,pack1(X3)),unpack1(X9,pack1(X9))))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.37 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.37 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.37 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_9, plain, (unpack1(inv(X7),pack1(X7))=X7), inference(start_rule)). % 0.19/0.37 cnf(i_0_39, plain, (unpack1(inv(X7),pack1(X7))=X7), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_67, plain, (inv(X7)=X7), inference(closure_rule, [i_0_7])). % 0.19/0.37 cnf(i_0_68, plain, (inv(X7)!=unpack1(inv(X7),pack1(X7))), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_84, plain, (inv(X7)!=unpack1(inv(X7),pack1(inv(X7)))), inference(closure_rule, [i_0_8])). % 0.19/0.37 cnf(i_0_85, plain, (unpack1(inv(X7),pack1(inv(X7)))!=unpack1(inv(X7),pack1(X7))), inference(etableau_closure_rule, [i_0_85, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.37 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.37 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.37 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X5,pack1(X5))=X5), inference(start_rule)). % 0.19/0.37 cnf(i_0_38, plain, (unpack1(X5,pack1(X5))=X5), inference(extension_rule, [i_0_36])). % 0.19/0.37 cnf(i_0_56, plain, (pack1(unpack1(X5,pack1(X5)))=pack1(X5)), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_67, plain, (pack1(unpack1(X5,pack1(X5)))=inv(pack1(unpack1(X5,pack1(X5))))), inference(closure_rule, [i_0_7])). % 0.19/0.37 cnf(i_0_69, plain, (pack1(X5)!=inv(pack1(unpack1(X5,pack1(X5))))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.37 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.37 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.37 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X7,pack1(X7))=X7), inference(start_rule)). % 0.19/0.37 cnf(i_0_38, plain, (unpack1(X7,pack1(X7))=X7), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_51, plain, (inv(X7)=X7), inference(closure_rule, [i_0_7])). % 0.19/0.37 cnf(i_0_52, plain, (inv(X7)!=unpack1(X7,pack1(X7))), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_68, plain, (inv(X7)!=unpack1(inv(X7),pack1(inv(X7)))), inference(closure_rule, [i_0_8])). % 0.19/0.37 cnf(i_0_69, plain, (unpack1(inv(X7),pack1(inv(X7)))!=unpack1(X7,pack1(X7))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X1,pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_9, plain, (unpack1(inv(X1),pack1(X1))=X1)). % 0.19/0.37 cnf(i_0_10, plain, (unpack1(X1,inv(pack1(X1)))=X1)). % 0.19/0.37 cnf(i_0_7, plain, (inv(X1)!=X1)). % 0.19/0.37 cnf(i_0_6, plain, (X1=i|X1=o)). % 0.19/0.37 cnf(i_0_31, plain, (X2=X2)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_8, plain, (unpack1(X3,pack1(X3))=X3), inference(start_rule)). % 0.19/0.37 cnf(i_0_38, plain, (unpack1(X3,pack1(X3))=X3), inference(extension_rule, [i_0_35])). % 0.19/0.37 cnf(i_0_54, plain, (inv(unpack1(X3,pack1(X3)))=inv(X3)), inference(extension_rule, [i_0_34])). % 0.19/0.37 cnf(i_0_67, plain, (inv(unpack1(X3,pack1(X3)))=unpack1(X3,pack1(X3))), inference(closure_rule, [i_0_7])). % 0.19/0.37 cnf(i_0_69, plain, (inv(X3)!=unpack1(X3,pack1(X3))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Child (4471) has found a proof. % 0.19/0.37 % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------