%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV552-1.007 : TPTP v8.1.0. Released v4.0.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 : n028.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 : Wed Jul 20 18:22:32 EDT 2022 % Result : Satisfiable 0.14s 0.40s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWV552-1.007 : TPTP v8.1.0. Released v4.0.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n028.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Thu Jun 16 00:56:11 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 32 Number of unprocessed: 32 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 32 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 31 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 1 extension rule candidate clauses % 0.14/0.39 # 31 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 39 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 39 tableaux to operate on % 0.14/0.40 # 26031 Satisfiable branch % 0.14/0.40 # 26032 Satisfiable branch % 0.14/0.40 # 26033 Satisfiable branch % 0.14/0.40 # 26034 Satisfiable branch % 0.14/0.40 # Satisfiable branch found. % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 0 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 0 successful branch saturations after the branch. % 0.14/0.40 # Satisfiable branch found. % 0.14/0.40 # 26035 Satisfiable branch % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 0 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 0 successful branch saturations after the branch. % 0.14/0.40 # 26036 Satisfiable branch % 0.14/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53)). % 0.14/0.40 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)). % 0.14/0.40 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)). % 0.14/0.40 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)). % 0.14/0.40 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)). % 0.14/0.40 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)). % 0.14/0.40 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)). % 0.14/0.40 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)). % 0.14/0.40 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)). % 0.14/0.40 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)). % 0.14/0.40 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)). % 0.14/0.40 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)). % 0.14/0.40 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)). % 0.14/0.40 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)). % 0.14/0.40 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)). % 0.14/0.40 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)). % 0.14/0.40 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)). % 0.14/0.40 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)). % 0.14/0.40 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)). % 0.14/0.40 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)). % 0.14/0.40 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)). % 0.14/0.40 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)). % 0.14/0.40 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)). % 0.14/0.40 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)). % 0.14/0.40 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)). % 0.14/0.40 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)). % 0.14/0.40 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)). % 0.14/0.40 cnf(i_0_47, hypothesis, (store(a_49,i1,e_52)=a_53)). % 0.14/0.40 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)). % 0.14/0.40 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.14/0.40 cnf(i_0_64, negated_conjecture, (a1!=a2)). % 0.14/0.40 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.14/0.40 cnf(i_0_70, plain, (X5=X5)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)). % 0.14/0.40 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_75])). % 0.14/0.40 cnf(i_0_124, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_123, plain, (select(a_55,a_55)=select(a_53,a_53)), inference(extension_rule, [i_0_74])). % 0.14/0.40 cnf(i_0_177, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_178, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53)). % 0.14/0.40 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)). % 0.14/0.40 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)). % 0.14/0.40 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)). % 0.14/0.40 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)). % 0.14/0.40 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)). % 0.14/0.40 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)). % 0.14/0.40 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)). % 0.14/0.40 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)). % 0.14/0.40 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)). % 0.14/0.40 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)). % 0.14/0.40 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)). % 0.14/0.40 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)). % 0.14/0.40 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)). % 0.14/0.40 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)). % 0.14/0.40 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)). % 0.14/0.40 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)). % 0.14/0.40 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)). % 0.14/0.40 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)). % 0.14/0.40 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)). % 0.14/0.40 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)). % 0.14/0.40 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)). % 0.14/0.40 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)). % 0.14/0.40 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)). % 0.14/0.40 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)). % 0.14/0.40 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)). % 0.14/0.40 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)). % 0.14/0.40 cnf(i_0_47, hypothesis, (store(a_49,i1,e_52)=a_53)). % 0.14/0.40 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)). % 0.14/0.40 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.14/0.40 cnf(i_0_64, negated_conjecture, (a1!=a2)). % 0.14/0.40 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.14/0.40 cnf(i_0_70, plain, (X5=X5)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)). % 0.14/0.40 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_75])). % 0.14/0.40 cnf(i_0_125, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_123, plain, (select(a_55,a_55)=select(a_53,a_53)), inference(extension_rule, [i_0_74])). % 0.14/0.40 cnf(i_0_177, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_178, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # 26037 Satisfiable branch % 0.14/0.40 # Satisfiable branch found. % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 0 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 0 successful branch saturations after the branch. % 0.14/0.40 # Child (26031) has found a proof. % 0.14/0.40 % 0.14/0.40 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53)). % 0.14/0.40 cnf(i_0_49, hypothesis, (select(a2,i1)=e_28)). % 0.14/0.40 cnf(i_0_50, hypothesis, (select(a1,i1)=e_30)). % 0.14/0.40 cnf(i_0_51, hypothesis, (select(a_31,i2)=e_32)). % 0.14/0.40 cnf(i_0_52, hypothesis, (select(a_29,i2)=e_34)). % 0.14/0.40 cnf(i_0_53, hypothesis, (select(a_35,i3)=e_36)). % 0.14/0.40 cnf(i_0_54, hypothesis, (select(a_33,i3)=e_38)). % 0.14/0.40 cnf(i_0_55, hypothesis, (select(a_39,i4)=e_40)). % 0.14/0.40 cnf(i_0_56, hypothesis, (select(a_37,i4)=e_42)). % 0.14/0.40 cnf(i_0_57, hypothesis, (select(a_43,i5)=e_44)). % 0.14/0.40 cnf(i_0_58, hypothesis, (select(a_41,i5)=e_46)). % 0.14/0.40 cnf(i_0_59, hypothesis, (select(a_47,i6)=e_48)). % 0.14/0.40 cnf(i_0_60, hypothesis, (select(a_45,i6)=e_50)). % 0.14/0.40 cnf(i_0_61, hypothesis, (select(a_51,i7)=e_52)). % 0.14/0.40 cnf(i_0_62, hypothesis, (select(a_49,i7)=e_54)). % 0.14/0.40 cnf(i_0_35, hypothesis, (store(a1,i1,e_28)=a_29)). % 0.14/0.40 cnf(i_0_36, hypothesis, (store(a2,i1,e_30)=a_31)). % 0.14/0.40 cnf(i_0_37, hypothesis, (store(a_29,i2,e_32)=a_33)). % 0.14/0.40 cnf(i_0_38, hypothesis, (store(a_31,i2,e_34)=a_35)). % 0.14/0.40 cnf(i_0_39, hypothesis, (store(a_33,i3,e_36)=a_37)). % 0.14/0.40 cnf(i_0_40, hypothesis, (store(a_35,i3,e_38)=a_39)). % 0.14/0.40 cnf(i_0_41, hypothesis, (store(a_37,i4,e_40)=a_41)). % 0.14/0.40 cnf(i_0_42, hypothesis, (store(a_39,i4,e_42)=a_43)). % 0.14/0.40 cnf(i_0_43, hypothesis, (store(a_41,i5,e_44)=a_45)). % 0.14/0.40 cnf(i_0_44, hypothesis, (store(a_43,i5,e_46)=a_47)). % 0.14/0.40 cnf(i_0_45, hypothesis, (store(a_45,i6,e_48)=a_49)). % 0.14/0.40 cnf(i_0_46, hypothesis, (store(a_47,i6,e_50)=a_51)). % 0.14/0.40 cnf(i_0_47, hypothesis, (store(a_49,i1,e_52)=a_53)). % 0.14/0.40 cnf(i_0_48, hypothesis, (store(a_51,i7,e_54)=a_53)). % 0.14/0.40 cnf(i_0_33, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.14/0.40 cnf(i_0_64, negated_conjecture, (a1!=a2)). % 0.14/0.40 cnf(i_0_34, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.14/0.40 cnf(i_0_70, plain, (X5=X5)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_63, hypothesis, (a_55=a_53), inference(start_rule)). % 0.14/0.40 cnf(i_0_76, plain, (a_55=a_53), inference(extension_rule, [i_0_74])). % 0.14/0.40 cnf(i_0_120, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_121, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 cnf(i_0_119, plain, (store(a_55,a_55,a_55)=store(a_53,a_53,a_53)), inference(extension_rule, [i_0_75])). % 0.14/0.40 cnf(i_0_189, plain, (a_55!=a_53), inference(closure_rule, [i_0_63])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Satisfiable branch found. % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 0 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 0 successful branch saturations after the branch. % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------